2017年3月20日
Codefoces 791D. Bear and Tree Jumps 树形DP
摘要： D. Bear and Tree Jumps A tree is an undirected connected graph without cycles. The distance between two vertices is the number of edges in a simple pa 阅读全文
posted @ 2017-03-20 15:50 meekyan 阅读(673) 评论(0) 推荐(0)