hdu 1102 Constructing Roads（并查集）

哎···，英语看的头疼!你就不能出汉语吗！你是考编程还是考英语 啊！英语是哥的软肋你知不知道啊！一道A+B就可以让你用英语说得哥都不敢做了！

擦·~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

貌似上次的省赛选拔赛也有英语读不懂的原因而错过！虽然俺也不想参加所谓的省赛！！！

曾经多少次测试由于看不懂题目而没做，而且貌似不难的题目啊！！苍天啊！大地啊！！为啥非要搞英语题目啊！！！！啊啊啊啊··················

难道这是为了和世界接轨？啊啊啊啊啊啊啊啊啊啊啊啊·································，我看你是为了让哥”“”出轨““”“啊！英语伤不起啊！！！！这么热的天，你还让我读那该死的英语！

好吧！我错了！！！一个字！！！烦！！！

哎····，纯属发牢骚！英语好有用！可惜俺是学不会了！哎·····，惆怅···············································································································································································

题意：

一道简单的题目被说的·····，好吧！就是让你求出连接所有村庄的最短路径，畅通工程就有这样的题目，貌似根本啥也，没变啊！

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

#include<algorithm>

using namespace std;


struct node
{
int x,y;
int z;
}a[50000];


int pre[50000];
int find(int k)
{
if(k==pre[k])
return k;
return pre[k]=find(pre[k]);
}


int cmp(node a,node b)
{
return a.z<b.z;
}


int main()
{
int n,m,r,t,f1,f2,ans,i,j,q;
while(scanf("%d",&n)!=EOF)
{
q=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&a[q].z);
a[q].x=i;
a[q].y=j;
q++;
}
sort(a,a+q,cmp);
for(i=1;i<=q;i++)
pre[i]=i;
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&r,&t);
f1=find(r);
f2=find(t);
if(f1!=f2)
pre[f1]=f2;
}
ans=0;
for(i=0;i<q;i++)
{
f1=find(a[i].x);
f2=find(a[i].y);
if(f1!=f2)
{
pre[f1]=f2;
ans+=a[i].z;
}
}
printf("%d\n",ans);
}
return 0;
}

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1102