最小生成树
Wang_SF2015
这个作者很懒,什么都没留下…
展开
-
文章标题 POJ 2349:Arctic Network ( 最小生成树Kruskal算法+并查集)
Arctic NetworkDescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establish原创 2016-08-18 16:17:25 · 511 阅读 · 0 评论 -
文章标题 HDU 2686 : Tree (最小生成树+普通筛)
TreeThere are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a prime number or (VA+VB) is a pr原创 2017-07-28 10:25:12 · 278 阅读 · 0 评论 -
文章标题 HDU 2122: Ice_cream’s world III (最小生成树+kruskal)
Ice_cream’s world IIIice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautif原创 2017-07-27 08:29:02 · 287 阅读 · 0 评论 -
文章标题 HDU 1875: 畅通工程再续(最小生成树)
畅通工程再续相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖,发展首先要解决的问题当然是交通问题,政府决定实现百岛湖的全畅通!经过考察小组RPRush对百岛湖的情况充分了解后,决定在符合条件的小岛间建上桥,所谓符合条件,就是2个小岛之间的距离不能小于10米,也不能大于1000米。当然,为了节省资金,只要求实现原创 2017-07-27 08:35:17 · 349 阅读 · 1 评论 -
文章标题 HDU 2489 : Minimal Ratio Tree (最小生成树+状态压缩二进制思想)
Minimal Ratio TreeFor a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation. Given a complete graph of n nodes with all nodes and edges weigh原创 2017-07-28 09:51:09 · 398 阅读 · 0 评论 -
文章标题 POJ 1789 :Truck History (最小生成树+prim)
Truck History传送门 题意:有n辆车,每辆车有一个7个字符的编号,然后一辆车车可以衍生出另一辆车,所花费的代价是两辆车中的编号对应字符不一样的数目,然后要求第一辆衍生出第2~第n辆车所需要的最小花费。 分析:题意有点难理解,其实就是求最小生成树,计算任意两个点之间的距离,然后直接用prim算法就行了。 代码:#include <iostream> #include <cstdio>原创 2017-07-26 18:53:09 · 270 阅读 · 0 评论 -
文章标题 POJ 1258 : Agri-Net(最小生成树--kruskal)
Agri-NetDescription Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer Jo原创 2016-11-13 22:07:01 · 284 阅读 · 0 评论 -
文章标题 POJ 2485 : Highways(最小生成树--kruskal+并查集)
HighwaysDescription 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原创 2016-11-13 21:53:22 · 369 阅读 · 0 评论 -
文章标题 HDU 4786 : Fibonacci Tree(最小生成树--kruskal+并查集)
Fibonacci TreeDescription Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: Consi原创 2016-10-30 21:52:47 · 337 阅读 · 0 评论 -
文章标题 HDU 3371 : Connect the Cities(最小生成树--Kruskal+并查集)
Connect the CitiesDescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The gove原创 2016-10-30 21:08:45 · 384 阅读 · 0 评论 -
文章标题 coderforces 609E : Minimum spanning tree for each edge (MST+LCA)
Minimum spanning tree for each edge题意:就是有一个无向图n个点,m条边,然后对于第i条边,然后要们求出包含第i条边是最小生成树的权值是多少,然后输出m个值。 分析:首先先求出最小生成树,然后通过这个,然后对于每一条边(u,v),只需要求出u-> v这条路径上的最大边,用这条边替换(u,v)这条边即可,问题就转化成求u到v路径上的最大边,而求最大边可以用LCA中的原创 2017-09-25 23:00:00 · 292 阅读 · 0 评论