HDU-1233 还是畅通工程
题目链接:添加链接描述
思路:运用Kruskal(克鲁斯卡尔)算法构造最小生成树
#include<bits/stdc++.h>
using namespace std;
struct DDD{
int x,y,d;
bool operator<(DDD D){return d<D.d;}
}D[6050];
int sum;
int fa[110];
int find(int r){
if(r!=fa[r]) fa[r]=find(fa[r]);
return fa[r];
}
void hebing(DDD &D){
int t1,t2;
t1=find(D.x);
t2=find(D.y);
if(t1!=t2){
fa[t1]=t2;
sum+=D.d;
}
}
int main()
{
int x,y;
int n;
int i;
while(scanf("%d",&n)==1){
if(n==0) break;
for(i=1;i<=n;i++) fa[i]=i;
for(i=1;i<=n*(n-1)/2;i++){
cin>>D[i].x>>D[i].y>>D[i].d;
}
sort(D+1,D+1+n*(n-1)/2);
sum=0;
for(i=1;i<=n*(n-1)/2;i++)
hebing(D[i]);
cout<<sum<<endl;
}
return 0;
}