2015年6月3日
HDU 1875 畅通工程再续 (最小生成树)
摘要： 畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17913 Accepted Submission(s): 5593 Problem 阅读全文
posted @ 2015-06-03 16:39 Decouple 阅读(304) 评论(0) 推荐(0) 编辑
HDU 1233 还是畅通工程 (最小生成树)
摘要： 还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30542Accepted Submission(s): 13670Problem De... 阅读全文
posted @ 2015-06-03 16:31 Decouple 阅读(205) 评论(0) 推荐(0) 编辑
POJ 1679 The Unique MST (最小生成树)
摘要： The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22668 Accepted: 8038 Description Given a connected undirected graph, tell if 阅读全文
posted @ 2015-06-03 16:22 Decouple 阅读(617) 评论(1) 推荐(0) 编辑
POJ 1258 Agri-Net (最小生成树)
摘要： Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 43652 Accepted: 17856 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2015-06-03 15:41 Decouple 阅读(222) 评论(0) 推荐(0) 编辑
POJ 1751 Highways (最小生成树)
摘要： Highways Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1751 Appoint description: System Crawler (201 阅读全文
posted @ 2015-06-03 15:32 Decouple 阅读(285) 评论(0) 推荐(0) 编辑