hdu 1856 并查集

题意：求并查集中最大的集合的数据的个数

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<memory.h>
using namespace std;
const int maxn=10000002;
int m,a,b,ans;
struct node
{
    int fa,cnt;
}father[maxn];
int Find(int x)
{
    if(father[x].fa==-1)return x;
    return father[x].fa=Find(father[x].fa);
}
void Union(int x,int y)
{
    int xx=Find(x);
    int yy=Find(y);
    if(xx!=yy)
    {
        father[yy].fa=xx;
        father[xx].cnt+=father[yy].cnt;
        ans=max(ans,father[xx].cnt);
    }
    else
    {
        ans=max(ans,max(father[yy].cnt,father[xx].cnt));
    }
}
int main()
{
    while(scanf("%d",&m)!=EOF)
    {
        ans=1;
        for(int i=0;i<=10000000;i++)
        {
            father[i].fa=-1;
            father[i].cnt=1;
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d",&a,&b);
            Union(a,b);
        }
        printf("%d\n",ans);
    }
    return 0;
}