More is better（并查集）

http://acm.hdu.edu.cn/showproblem.php?pid=1856

More is better

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

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.

 

题意：王老师要找一些男生帮助他完成一项工程。要求最后挑选出的男生之间都是朋友关系，可以说直接的，也可以是间接地。问最多可以挑选出几个男生（最少挑一个)。

         并查集，这里合并的时候注意看清将谁的父亲指向谁，要是将F[fa] = fb说明fb是fa的父亲，下面在写个数叠加的时候要将fa的个数加到fb上，一开始写反了找了半天错，哎，傻呀

给出代码

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 100010
int F[N];
int G[N];
int Gf(int t)
{
    if(F[t]==-1) return t;
    F[t] = Gf(F[t]);
    return F[t];
}
int mx;
void bing (int a , int b)
{
    int fa = Gf(a);
    int fb = Gf(b);
    if(fa!=fb)
    {
        F[fa] = fb;
        G[fb] += G[fa];
        mx = max(mx,G[fb]);
    }
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        mx = 0;
        memset(F,-1,sizeof(F));
        for(int i = 1 ;i <= N ;i++)
        {
            G[i] = 1;
        }
        for(int i = 0 ;i < n ;i++)
        {
            int a , b;
            scanf("%d%d",&a,&b);
            bing (a, b);
        }
        printf("%d
",mx);
    }
    return 0;
}