并查集模板

#include "stdio.h"
const int maxn = 1005;
int n,m;
int p[maxn],rank[maxn];              
int find( int x )
{
    if( p[x] == x )
        return p[x];
    else
    {
        return p[x] = find( p[x] );
    }
}
void merge( int a,int b )
{
    int x = find(a);
    int y = find(b);
    if( rank[x] > rank[y] )
    {
        p[y] = x;
    }
    else
    {
        p[x] = y;
        if( rank[x] == rank[y] )
            rank[y]++;
    }
}
int main()
{
    int i,a,b;
    while( scanf("%d",&n)!=EOF,n )
    {
        scanf("%d",&m);
        int ans=0;
        for( i=1;i<=n;i++ )
        {
            p[i]=i;
            rank[i] = 0;
        }
        for( i=1;i<=m;i++ )
        {
            scanf("%d%d",&a,&b);
            merge( a,b );
        }
        for( i=1;i<=n;i++ )
        {
            if( p[i]==i )
                ans++;
        }
        printf("%d\n",ans);    //连通分量数
    }
    return 0;
}