最小生成树
技术麻瓜
时间并不会因为你的迷茫和迟疑而停留
展开
-
HDU 1102
Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, i原创 2014-08-05 14:49:53 · 397 阅读 · 0 评论 -
HDU 3371
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7040 Accepted Submission(s): 2008 Problem Description I原创 2014-08-07 15:08:01 · 510 阅读 · 0 评论 -
HDU 1863
《BestCoder用户手册》下载 畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16844 Accepted Submission(s): 7044 Problem Descri原创 2014-08-06 16:27:30 · 398 阅读 · 0 评论