最小生成树(prim)--poj2377
来源:互联网 发布:快捷混合矩阵 编辑:程序博客网 时间:2024/05/18 00:50
Language:
Bad Cowtractors
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9438 Accepted: 4037
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思路:求费用最高,建图的时候可以把费用去相反数,然后求最小生成树。#include<iostream>#include<set>#include<map>#include<vector>#include<queue>#include<cmath>#include<climits>#include<cstdio>#include<string>#include<cstring>#include<algorithm>typedef long long LL;using namespace std;const int INF=10000000;int N,M;int col[1005][1005];int dis[1005];bool vis[1005];void prim(){ int ans=0; int biao; for(int i=1; i<=N; i++) { if(col[1][i]==0) dis[i]=INF; else dis[i]=col[1][i]; vis[i]=false; } dis[1]=0; vis[1]=true; for(int i=2; i<=N; i++) { int min1=INF; for(int j=2; j<=N; j++) { if((!vis[j])&&dis[j]<min1) { min1=dis[j]; biao=j; } } ans+=min1; vis[biao]=true; for(int j=1; j<=N; j++) if((!vis[j])&&(col[j][biao]!=0)&&dis[j]>col[j][biao]) dis[j]=col[j][biao]; } for(int i=1; i<=N; i++) if(dis[i]>=INF) { cout<<-1<<endl; return; } cout<<-ans<<endl;}int main(){ //freopen("in.txt","r",stdin); int u,v,x; while(cin>>N>>M) { memset(col,0,sizeof(col)); memset(vis,false,sizeof(vis)); for(int i=1; i<=M; i++) { cin>>u>>v>>x; col[u][v]=min(col[u][v],-x); col[v][u]=col[u][v]; } prim(); } return 0;}
- 最小生成树(prim)--poj2377
- poj2377 最小生成树
- POJ2377 Bad Cowtractors 最小生成树
- poj2377 Bad Cowtractors(最小生成树)
- Prim最小生成树
- 最小生成树 prim
- 最小生成树 Prim
- 最小生成树-Prim
- Prim最小生成树
- 最小生成树 Prim
- prim最小生成树
- 最小生成树prim
- 最小生成树 prim
- prim 最小生成树
- Prim 最小生成树
- 最小生成树---Prim
- 最小生成树-prim
- 最小生成树---Prim
- 一不小心发现一个检测开机时间的函数~
- struts2-常用规范
- Ubuntu配置SubVersion SVN
- Android利用Volley异步加载数据(JSON和图片)完整示例
- 记录学习旅途所遇到的问题-ubuntu
- 最小生成树(prim)--poj2377
- UVa 10413 Crazy Savages(扩展欧几里得)
- 序列化接口的id有什么用?—— Java经典面试题系列
- cocos2d中sprite Action接口及动画实现思路总结
- Udacity调试课笔记之简化的哲学思考
- 数码管显示单元的实验
- JDeveloper 界面主要区域及功能介绍
- Windows7优化开机速度的方法只需一步设置
- Vector(向量容器)