最小生成树
文章平均质量分 89
Paul-Yang
天道酬勤
展开
-
POJ 1789 Truck History 最小生成树 kruskal && Prim
Truck History 克鲁斯卡尔 最小生成树,两两不同个数为权值, Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a原创 2015-08-11 19:52:10 · 411 阅读 · 0 评论 -
HDOJ 2122 Ice_cream’s world III【Prime】&【Kruskal】
Ice_cream’s world III Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1384 Accepted Submission(s): 465 Problem Description ice_c原创 2015-11-04 21:42:39 · 329 阅读 · 0 评论 -
POJ 2485 Highways 最小生成树 Kruskal && Prim
Highways 求最小生成树的最大边 The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning to build some highways原创 2015-08-13 19:12:50 · 439 阅读 · 0 评论 -
NYOJ 38 布线问题 (最小生成树 Kruskal)
布线问题 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述南阳理工学院要进行用电线路改造,现在校长要求设计师设计出一种布线方式,该布线方式需要满足以下条件: 1、把所有的楼都供上电。 2、所用电线花费最少 输入第一行是一个整数n表示有n组测试数据。(n 每组测试数据的第一行是两个整数v,e. v表示学校里楼的总个数(v 随后原创 2015-09-25 18:30:11 · 438 阅读 · 0 评论 -
POJ 1751 Highways 最小生成树 Kruskal && Prim
最小生成树 Kruscal && Prim 给定n个城市,给定了已经连接起来的道路,输出的是城镇的编号, The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a num原创 2015-08-13 18:44:15 · 517 阅读 · 0 评论 -
ZOJ 2048 Highways 最小生成树 Kruskal && Prim
Highways 最小生成树 Kruscal && Prim 给定n个城市,给定了已经连接起来的道路,输出的是城镇的编号, The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already cons原创 2015-08-13 17:48:15 · 941 阅读 · 0 评论 -
POJ 2235 Frogger 最小生成树 Kruskal && Prim
Frogger 最小生成树 Kruscal && Prim 给出两只青蛙的坐标A、B,和其他的n-2个坐标,任一两个坐标点间都是双向连通的。 显然从A到B存在至少一条的通路,每一条通路的元素都是这条通路中前后两个点的距离, 这些距离中又有一个最大距离。 要求: 他最小的弹跳距离是多少(即最短路径中的最长边)。 在生成最小生成树时,只要 A,B 连一起后,其余的点就不用再连 (不需要把所有的点都连起来) 最小生成树 Kruscal rim 模原创 2015-08-13 19:05:53 · 930 阅读 · 0 评论 -
HDOJ 3371 Connect the Cities 【Prime】
Connect the Cities Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14510 Accepted Submission(s): 3877 Problem Description In 210原创 2015-11-05 21:58:23 · 296 阅读 · 0 评论 -
POJ 2075 Tangled in Cables 最小生成树 Kruskal && Prim
最小生成树 , Kruscal && Prim ,将房屋转变为编号,就是一 模板题 You are the owner of SmallCableCo and have purchased the franchise rights for a small town. Unfortunately, you lack enough funds to start your business properly and are relying on parts you have found in an o原创 2015-08-13 18:57:55 · 501 阅读 · 0 评论 -
HDOJ 2682 Tree 【prime】【kruskal】
Tree Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2104 Accepted Submission(s): 607 Problem Description There are N (2<=N<=600原创 2015-11-10 22:12:21 · 294 阅读 · 0 评论 -
HDOJ 1233 还是畅通工程 最小生成树 kruskal && prim
还是畅通工程 克鲁斯卡尔(kruskal) 思想 Prim 思想 还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32568 Accepted Submission(s): 14651 Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通原创 2015-08-11 14:01:38 · 341 阅读 · 0 评论 -
HDOJ 1875 畅通工程再续 最小生成树 kruskal && prim
畅通工程再续 克鲁斯卡尔(思想) Prim思想 畅通工程再续 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19449 Accepted Submission(s): 6092 Problem Description 相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他的小岛时都要原创 2015-08-11 14:32:21 · 2073 阅读 · 0 评论 -
HDOJ 1301 Jungle Roads 最小生成树 kruskal && prim
Jungle Roads 说明:求最小生成树(用 克鲁斯卡尔) 题目大意: 在相通n个岛屿的所有桥都坏了,要重修, 重修每一个桥所用的时间不同,求重修使每个岛屿都间接或直接与其他岛屿相同时所用的的最短时间(只有修完一个桥后才可修下一个桥)。------------求最小生成树。 数据: 数据输入的第一行n代表岛屿的个数,当为0是结束程序,接着n-1行开始时为这岛屿的编号,用大写字母表示,接着是一个整数 m,表示与该岛屿连接的字典序大于该岛屿编号的个数,然后该行输入原创 2015-08-11 17:52:18 · 394 阅读 · 0 评论 -
POJ 1258 Agri-Net 最小生成树 prim && kruskal
Agri-Net 最小生成树 Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 45228 Accepted: 18575 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms原创 2015-08-12 16:09:24 · 558 阅读 · 0 评论 -
ZOJ 1203 Swordfish 最小生成树 Kruscal && Prim
Swordfish 最小生成树 Swordfish Time Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, passwords and the most advanced security systems. In thi原创 2015-08-13 17:21:22 · 638 阅读 · 0 评论 -
ZOJ 2966 Build The Electric System 最小生成树 Kruscal && Prim
Build The Electric System 最小生成树 Kruscal && Prim Build The Electric System Time Limit: 2 Seconds Memory Limit: 65536 KB In last winter, there was a big snow storm in South China. The electric system was damaged seriously. Lots of power lines wer原创 2015-08-13 17:35:23 · 742 阅读 · 0 评论 -
ZOJ 1372 Networking 最小生成树 Kruscal && Prim
Networking 最小生成树 Kruscal && Prim Networking Time Limit: 2 Seconds Memory Limit: 65536 KB You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible原创 2015-08-13 17:28:02 · 421 阅读 · 0 评论 -
POJ 2349 Arctic Network 最小生成树 prim && kruscal
Arctic Network 克鲁斯卡尔(kruscal)或普里姆算法(Prim) 求最小生成树。 Arctic Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13208 Accepted: 4284 Description The Department of National Defence (DND) wishes to connect several northern outposts by a w原创 2015-08-12 21:36:36 · 557 阅读 · 0 评论 -
HDOJ 1863 畅通工程 最小生成树 kruskal && prim
畅通工程 克鲁斯卡尔(kruskal) 思想 (prim思想) 畅通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21372 Accepted Submission(s): 9195 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有原创 2015-08-11 14:11:44 · 361 阅读 · 0 评论 -
HDOJ 1162 Eddy's picture 最小生成树 Kruscal && Prim
Eddy's picture 最小生成树,模板 Kruscal 或 Prim Eddy's picture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8122 Accepted Submission(s): 4118 Problem Description Eddy begins to like paint原创 2015-08-13 17:03:51 · 358 阅读 · 0 评论 -
HDOJ 1102 Constructing Roads 最小生成树 kruskal && Prim
Constructing Roads 题意: 有N个村庄,给定我们每个村庄之间的距离,而两个村庄可以间接相连。 矩阵 :横坐标与纵坐标表示两个村子,值为两个村子的距离; 然后告诉我们原本有几个村庄已经相连有路相通。要让我们求还要建多长的路,最小的。 可以用最小生成树,先把给定的已相连的村庄之间的权值赋为0,其余跟求最小生成树一样。原创 2015-08-11 21:16:02 · 403 阅读 · 0 评论 -
HDOJ 1879 继续畅通工程 最小生成树 kruskal && prim
继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17846 Accepted Submission(s): 7683 Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间原创 2015-08-11 16:15:22 · 410 阅读 · 0 评论 -
POJ 2031 Building a Space Station【最小生成树 Kruskal】
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6232 Accepted: 3089 Description You are a member of the space station engineerin原创 2015-11-12 20:31:28 · 337 阅读 · 0 评论