算法笔记-问题 D: More is better

问题 D: More is better

题目描述

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.

输入

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)

输出

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

样例输入 Copy

3
1 3
1 5
2 5
4
3 2
3 4
1 6
2 6

样例输出 Copy

4
5

代码：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 10000010;

int father[maxn];
int cont[maxn];
int n, m, ans = 0;

/*寻找祖先*/
int findFather(int x){
    int a = x;
    while(x!=father[x]){
        x = father[x];
    }
    while(a!=father[a]){
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

/*合并*/
void Union(int a, int b){
    int faA = findFather(a);
    int faB = findFather(b);
    if(faA != faB){
        father[faA] = faB;
        cont[faB] += cont[faA];
    }
    ans = max(ans, cont[faB]);
}

/*初始化*/
void init(){
    for(int i=1; i<maxn; i++){
        father[i] = i;
        cont[i] = 1;
    }
}

int main(){
    int N;
    while(scanf("%d", &N)!=EOF){
        if(N==0){
            printf("1\n");
            continue;
        }
        init();
        while(N--){
            int a, b;
            scanf("%d%d", &a, &b);
            Union(a, b);
        }
        printf("%d\n", ans);
    }
	return 0;
}