还是畅通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9432 Accepted Submission(s): 4290
当N为0时,输入结束,该用例不被处理。
3 1 2 1 1 3 2 2 3 4 4 1 2 1 1 3 4 1 4 1 2 3 3 2 4 2 3 4 5 0
3 5Huge input, scanf is recommended.HintHint
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int f[1009];
#define M 109
struct node{
int a,b,dist;
}road[M*(M-1)/2+1];
int find(int x)
{
if(f[x]==x)
return x;
return find(f[x]);
}
int cmp(const void *a,const void *b)
{
struct node *c,*d;
c=(struct node *)a;
d=(struct node *)b;
return c->dist-d->dist;
}
int main()
{
int n,i,sum;
while(scanf("%d",&n),n!=0)
{
for(i=0;i<n*(n-1)/2;i++)
scanf("%d%d%d",&road[i].a,&road[i].b,&road[i].dist);
for(i=1;i<=n;i++)
f[i]=i;
qsort(road,n*(n-1)/2,sizeof(road[0]),cmp);
sum=0;
for(i=0;i<n*(n-1)/2;i++)
{
road[i].a=find(road[i].a);
road[i].b=find(road[i].b);
if(road[i].a!=road[i].b)
{
sum+=road[i].dist;
f[road[i].a]=road[i].b;
}
}
printf("%d\n",sum);
}
return 0;
}