最小生成树
文章平均质量分 85
还是太年轻
这个作者很懒,什么都没留下…
展开
-
HDU 1875 畅通工程再续(最小生成树问题)Prim算法
畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 32209 Accepted Submission(s): 10564 Problem Description 相信大家都听说一个“百岛湖”的地方原创 2018-01-14 21:28:36 · 176 阅读 · 0 评论 -
UVA 1151 Buy or Build (Kruskal+二进制枚举子集)
问题 L: Buy or Build 时间限制: 20 Sec 内存限制: 128 MB 提交: 6 解决: 4 [提交][状态][讨论版] 题目描述 World Wide Networks (WWN) is a leading company that operates large telecommunication networks. WWN would like to原创 2018-01-29 15:51:45 · 181 阅读 · 0 评论 -
URAL 1982 Electrification Plan (Prim or Kruskal)
Electrification Plan Some country has n cities. The government has decided to electrify all these cities. At first, power stations in k different cities were built. The other cities should be c原创 2018-01-29 12:00:20 · 236 阅读 · 0 评论 -
zufeoj 引水工程
问题 J: 引水工程 时间限制: 3 Sec 内存限制: 128 MB 提交: 5 解决: 4 [提交][状态][讨论版] 题目描述 南水北调工程是优化水资源配置、促进区域协调发展的基础性工程,是新中国成立以来投资额最大、涉及面最广的战略性工程,事关中华民族长远发展。“南水北调工程”,旨在缓解中国华北和西北地区水资源短缺的国家战略性工程。就是把中国长江流域丰盈的水资源抽调一部原创 2018-01-29 09:51:59 · 216 阅读 · 0 评论 -
POJ 1679 The Unique MST(次小生成树)
The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions:33267 Accepted: 12111 Description Given a connected undirected graph, tell if its minimum s原创 2018-01-29 08:36:22 · 124 阅读 · 0 评论 -
POJ 3723 Conscription(最小生成树 Kruskal算法)
Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions:15063 Accepted: 5228 Description Windy has a country, and he wants to build an army to protec转载 2018-01-16 15:23:28 · 182 阅读 · 0 评论 -
HDU 4081 Qin Shi Huang's National Road System(最小生成树,记录圈中最大边后暴力枚举)
Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/3 2768 K (Java/Others) Total Submission(s): 9308 Accepted Submission(s): 3309 Problem De原创 2018-01-31 13:56:43 · 188 阅读 · 0 评论 -
HDU 3371 Connect the Cities
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 22818 Accepted Submission(s): 5269 Problem Description In 210原创 2018-01-31 11:23:30 · 153 阅读 · 0 评论 -
HDU 2988 Dark rodes
Dark roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1218 Accepted Submission(s): 530 Problem Description Economic times t原创 2018-01-31 09:30:14 · 142 阅读 · 0 评论 -
HDU 1863 畅通工程(最小生成树)
畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 33794 Accepted Submission(s): 14950 Problem Description 省政府“畅通工程”的目标是使全省任何两原创 2018-01-15 21:59:11 · 104 阅读 · 0 评论 -
HDU 1879 继续畅通工程(最小生成树)
继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 26893 Accepted Submission(s): 11352 Problem Description 省政府“畅通工程”的目标是使全省任原创 2018-01-15 21:19:14 · 109 阅读 · 0 评论 -
POJ 2831 Can We Build This One (Prim+找圈中最大边)
Can We Build This One? Time Limit: 5000MS Memory Limit: 65536K Total Submissions:1860 Accepted: 682 Case Time Limit: 2000MS Description “Highways are built, th原创 2018-01-29 18:31:59 · 152 阅读 · 0 评论