UVA 1329 - Corporative Network

带权值的并查集的应用；

代码：

 #include<cstdio>
 #include<algorithm>
 #include<cmath>
 #include<cstring>
 #define maxn 20005
 using namespace std;

 int f[maxn];
 int d[maxn];
 int t,n,x,y;
 char s[];

 int find(int x)
 {
     if(f[x]!=x)
     {
         int r=find(f[x]);
         d[x]+=d[f[x]];
         return f[x]=r;
     }
     else return x;
 }

 int main()
 {
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d",&n);
         for(int i=; i<=n; i++){f[i]=i;d[i]=;}
         while(scanf("%s",s))
         {
             if(s[]=='O')break;
             if(s[]=='E')
             {
                 scanf("%d",&x);
                 find(x);
                 printf("%d\n",d[x]);
             }
             else if(s[]=='I')
             {
                 scanf("%d%d",&x,&y);
                 f[x]=y;
                 d[x]=abs(x-y)%;
             }
         }
     }
     return ;
 }