HDU 1856 More is better（基础并查集）

More is better

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 32121    Accepted Submission(s): 11346

Problem 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

Hint

A and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result. In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.

题意：老师挑男生干活，每次挑两个，如果直接或者间接为朋友就都留下来，如果不是就走一个。老师希望最后留下来尽可能多的男生。

思路：可以看出来题目要求的是节点最多的连通图，那么我们可以在用并查集处理的时候顺便在根节点上标记一下连通图中的元素个数。每更新一次判断一下大小就可以了。

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1e7+5;
int pre[maxn],num[maxn];
int fx,fy;
int Find(int x)
{
    int r=x;
    while(r!=pre[r])
        r=pre[r];
    int i=x,j;
    while(i!=r)
    {
        j=pre[i];
        pre[i]=r;
        i=j;
    }
    return r;
}
void join(int x,int y)
{
    fx=Find(x);
    fy=Find(y);
    if(fx!=fy)
    {
        pre[fx]=fy;
        //合并之后节点个数加起来
        num[fy]+=num[fx];
    }
}
void init()
{
    for(int i=0;i<maxn;i++)
    {
        pre[i]=i;
        //初始化节点个数，刚开始都为一个
        num[i]=1;
    }
}
int main()
{
    int n,a,b;
    while(scanf("%d",&n)!=EOF)
    {
        init();
        int mmax=1;
        while(n--)
        {
            scanf("%d %d",&a,&b);
            join(a,b);
            if(num[fy]>mmax)
                mmax=num[fy];
        }
        printf("%d\n",mmax);
    }
    return 0;
}