生成树
Waves___
这个作者很懒,什么都没留下…
展开
-
POJ 3723 Conscription
DescriptionWindy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier witho原创 2016-08-09 23:40:01 · 208 阅读 · 0 评论 -
POJ 1258 Agri-Net
DescriptionFarmer 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 John or原创 2016-08-09 23:41:36 · 241 阅读 · 0 评论 -
AIZU 2224 Save your cat
DescriptionNicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so cute that people in the village also loved them.One day, an evil wi原创 2016-08-09 23:42:58 · 424 阅读 · 0 评论 -
POJ 2395 Out of Hay
DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) fa原创 2016-08-09 23:45:09 · 203 阅读 · 0 评论 -
UVA 1151 Buy or Build
题目链接 http://acm.hust.edu.cn/vjudge/problem/36013题意平面上有n个点(1为此,你可以新建一些边,费用等于两个端点的欧几里得距离的平方。另外还有q(0如果你购买了第i个套餐,该套餐中的所有结点将变得相互连通,第i个套餐的花费为ci。求最小花费。就是求最小生成树对于套餐可以用子集枚举处理, 集合S表示套餐的购买状态原创 2016-08-10 22:36:25 · 277 阅读 · 0 评论 -
UVA 10048 Audiophobia
题目链接 http://acm.hust.edu.cn/vjudge/problem/22156从a点到b点, 找到一条路径,使得这条路径上的所有噪音中最大的值是所有路径中最小的求这个最小值我是先弄出一个最小生成树 然后将图存起来对于每个提问 都dfs一遍 将路径的权值存入path[] 当遍历到终点时 取path[]中的最大值 其他思路:还可原创 2016-08-10 22:40:26 · 318 阅读 · 0 评论 -
UVA 1395 Slim Span
题目链接 http://acm.hust.edu.cn/vjudge/problem/41567题意:给一个图,找一棵生成树,其满足:最大权-最小权的值最小。简单图,不一定连通,权值可能全相同。穷举所有生成树 #include #include #include #include #include #include #include #inc原创 2016-08-10 22:34:23 · 286 阅读 · 0 评论 -
HDU 5723 - Abandoned country(最小生成树+dfs)
/* https://vjudge.net/problem/HDU-5723题意:给定N个顶点M条边的无向图,每条边包含一个权值,权值都各不相同, 求最小生成树,并求最小生成树上的任意两点之间距离的最小期望。因为边权值各不相同,那么最小生成树是唯一的。那么只需要求最小生成树上的任意两点之间的距离之和除以N*(N-1)/2即可。先用Kruskal生成最小树,然后数每一条边通过原创 2017-01-20 23:07:13 · 422 阅读 · 0 评论