1603 Bad Cowtractors解题报告

  

Bad Cowtractors

时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte
总提交: 9            测试通过: 4

http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=1603

描述

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".

输入

* 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.

 

输出

* 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.

 

样例输入

 

5 8
1 2 3
1 3 7
2 3 10
2 4 4
2 5 8
3 4 6
3 5 2
4 5 17

 

样例输出

 

42

 

提示

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.

这个题目其实就是运用经典算法最小生成树  我用prim算法。还要一个是kruskal。

两者关系应该知道吧呵呵，不多说了。

这里的题目应该是 最大生成树。反正原理一样嘛。这个题目要注意的是可能输入的同一条路径有价格大小这时取大的。

就是要这样写输入的时候。看代码：

 

while(m--) { scanf("%d%d%d",&x,&y,&c); if(list[x][y]<c) //晕 这句加上ok了 测试数据好叼 { list[x][y]=c; list[y][x]=c; } }

 

 

完整代码：

#include<stdio.h> #include<string.h> #define MAX 1002 #define inf -0x7fffffff int list[MAX][MAX],desk[MAX],visit[MAX]; void mmemset(int n) { int i,j; for(i=0;i<=n;i++) for(j=0;j<=n;j++) list[i][j]=inf; } int prim(int n) { int max=-1,i,j,t=-1,sum=0; visit[1]=1; for(j=2;j<=n;j++) { t=max=-1; for(i=2;i<=n;i++) if(!visit[i]&&(desk[i]>max)) { max=desk[i]; t=i; } if(-1!=t) { visit[t]=1; sum+=max; } else return -1; ///更新 for(i=1;i<=n;i++) { if((!visit[i])&&(desk[i]<list[i][t])) { desk[i]=list[i][t]; } } } return sum; } int main() { int n,m,x,y,c; int i,sum; while(scanf("%d%d",&n,&m)!=EOF) { memset(visit,0,sizeof(visit)); mmemset(n); while(m--) { scanf("%d%d%d",&x,&y,&c); if(list[x][y]<c) //晕 这句加上ok了 测试数据好叼 { list[x][y]=c; list[y][x]=c; } } for(i=1;i<=n;i++) desk[i]=list[i][1]; sum=prim(n); printf("%d/n",sum); } return 0; }