随笔分类 -  最小生成树

kruskal& prim
hdu 1233 - 还是畅通工程(MST)
摘要：还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22297 Accepted Submission(s): 9961 Problem Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。... 阅读全文
posted @ 2014-03-08 22:25 姜楠 阅读(246) 评论(0) 推荐(0)
hdu 1863 - 畅通工程(MST)
摘要：畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14103 Accepted Submission(s): 5824 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（... 阅读全文
posted @ 2014-03-08 22:12 姜楠 阅读(346) 评论(0) 推荐(0)