摘要:
E. Close Vertices You've got a weighted tree, consisting of n vertices. Each edge has a non-negative weight. The length of the path between any two ve 阅读全文
摘要:
Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15548 Accepted: 5054 Description Give a tree with n vertices,each edge has a length(po 阅读全文