POJ2377(最大生成树)
来源:互联网 发布:病毒源码 编辑:程序博客网 时间:2024/06/07 01:01
Description
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie.
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
Output
* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.
Sample Input
5 81 2 31 3 72 3 102 4 42 5 83 4 63 5 24 5 17
Sample Output
42
Hint
OUTPUT DETAILS:
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
给出每条边的端点和权值,使他们生成一个树,且权值之和最大.
思路:先将每条边按权值从大到小排列,然后开始组合,如果两个端点的根节点相同,那么便跳过去.
代码如下:
#include<cstdio> #include<cmath>#include<cstring>#include<algorithm>using namespace std;struct node{int u,v,w;}edge[5000500];bool cmp(node a,node b){return a.w>b.w;}int n,m,i;int par[1010],sum=0,ant=0;void init(){for(i=1;i<=n;i++)par[i]=i;}int find(int x){if(x==par[x])return x;elsereturn par[x]=find(par[x]);}int unite(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){par[fy]=fx;return 1;}return 0;}int main(){while(scanf("%d%d",&n,&m)!=EOF){int ans=0;ant=0;for(i=1;i<=m;i++){scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);}sort(edge+1,edge+m+1,cmp); init();for(i=1;i<=m;i++){if(unite(edge[i].u,edge[i].v)){ant++;sum+=edge[i].w;//printf("%d\n",sum);}if(ant==n-1)break;}for(i=1;i<=n;i++){if(par[i]==i)ans++;}if(ans>1)printf("-1\n");elseprintf("%d\n",sum);}}
0 0
- POJ2377(最大生成树)
- poj2377 最大生成树 Kruskal
- POJ2377 Bad Cowtractors 【最大生成树】
- POJ2377 Bad Cowtractors(最大生成树)
- poj2377 Bad Cowtractors (最大生成树)
- poj2377 -- Bad Cowtractors(最大生成树)
- POJ2377 Bad Cowtractors【Kruskal】【求最大生成树】
- poj2377 最小生成树
- 最小生成树(prim)--poj2377
- POJ2377 用并查集实现最大生成树(速度较快)
- POJ2377 (详解) 用并查集实现最大生成树(速度较快)
- poj2377 Bad Cowtractors(最大生成树的Prim和Kruskal做法)
- POJ2377 Bad Cowtractors 最小生成树
- poj2377 Bad Cowtractors(最小生成树)
- POJ2377最大路径问题
- 最小生成树【Kruskal】POJ2377,POJ1258,poj2358,hdu1233
- poj2377
- poj2377
- xUtils框架的应用
- Devcpp使用技巧
- JAVA四种引用方式
- 数据结构实验之栈三:后缀式求值
- Java之内部类
- POJ2377(最大生成树)
- poj 3267 The Cow Lexicon
- Java 遍历Map的2种方法(KeySet、EntrySet)
- 串匹配
- 分布式存储系统sheepdog
- DatePickerDialog(日期选择)的简单应用
- Spring系列之事务处理
- 面向对象和面向过程的区别
- Unity自学之Update()、FixedUpdate()、LateUpdate()