kZjPBD.jpg
2019年4月15日
B - Edge to the Root （树上dfs+思维）
摘要： Given a tree with n vertices, we want to add an edge between vertex 1 and vertex x, so that the sum of d(1, v) for all vertices v in the tree is minim 阅读全文
posted @ 2019-04-15 18:49 Through_The_Night 阅读(292) 评论(0) 推荐(0)