HDU-1856-More is better(并查集)

Description

Mr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. Of course there are certain requirements.

Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.

 

Input

The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)

 

Output

The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.

 

Sample Input

4
1 2
3 4
5 6
1 6
4
1 2
3 4
5 6
7 8

 

Sample Output

4
2
#include <stdio.h>

int node[10000001],count[10000001],max;

int findroot(int x)
{
    if(node[x]!=x)
        node[x]=findroot(node[x]);//让途经的每一个父节点都指向根节点
    return node[x];
}

int main()
{
    int n,a,b,i,root1,root2;

    while(~scanf("%d",&n))
    {
        for(i=1;i<=10000000;i++)
        {
            node[i]=i;//初始化，每个节点都指向自己
            count[i]=1;//初始化计数器
        }

        max=1;//初始化最大值。如果没有直接朋友最大值应该是1，不是0，略坑。

        while(n--)
        {
            scanf("%d%d",&a,&b);

            root1=findroot(a);

            root2=findroot(b);

            if(root1!=root2)//如果根节点不同则合并
            {
                node[root1]=root2;
                count[root2]+=count[root1];
                if(count[root2]>max) max=count[root2];
            }
        }

        printf("%d\n",max);
    }
    
    return 0;
}