myeggbreakbeforeac的博客

Description Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two node

Cow Marathon Time Limit: 2000MS   Memory Limit: 30000K Total Submissions: 4948   Accepted: 2407 Case Time Limit: 1000MS Description After hearing about the epidemi

Roads in the North Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Description Building and maintaining roads among communities in the far North is an expensi