HDU(1856)，裸的带权并查集

#include <stdio.h>

int father[100050];
int rank[100050];

int Find_Set (int x)
{
    if(x!=father[x])
        father[x] = Find_Set(father[x]);
    return father[x];
}

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<100040;i++)
        {
            father[i] = i;
            rank[i] = 1;
        }

        for(int i=0;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int fx = Find_Set(x);
            int fy = Find_Set(y);
            if(fx!=fy)
            {
                father[fy] = fx;
                rank[fx] += rank[fy];
            }
        }

        int _max = 0;
        for(int i=0;i<100040;i++)
            _max = (rank[i]>_max) ? rank[i]:_max;
        printf("%d\n",_max);
    }
    return 0;
}