2013年10月18日

HDU 2122 Ice_cream’s world III

摘要： Ice_cream’s world IIITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 575Accepted Submission(s): 184 Problem Descriptionice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; 阅读全文

posted @ 2013-10-18 21:40 天使是一个善良的神 阅读(200) 评论(0) 推荐(0) 编辑

HDU 1863 畅通工程

摘要： 畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13267Accepted Submission(s): 5435 Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例 阅读全文

posted @ 2013-10-18 21:29 天使是一个善良的神 阅读(172) 评论(0) 推荐(0) 编辑

HDU 1102 Constructing Roads Prim

摘要： Constructing RoadsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some r 阅读全文

posted @ 2013-10-18 20:50 天使是一个善良的神 阅读(170) 评论(0) 推荐(0) 编辑

HDU 1102 Constructing Roads

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11576Accepted Submission(s): 4353 Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect t 阅读全文

posted @ 2013-10-18 20:43 天使是一个善良的神 阅读(191) 评论(0) 推荐(0) 编辑

导航