2130:More is better

2130:More is better分数: 3.2

时间限制：1 秒

内存限制：128 兆

特殊判题： 否

提交：6

解决： 2

题目描述

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.

样例输入

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

样例输出

4
5

提示[+]

*** 提示已隐藏，点击上方 [+] 可显示 ***

分类

自己写的压缩路径，简练高效，一次循环解决超时问题

#include <stdio.h>


struct Node{
    int pre;
    int rank;
}tree[10000005];
int maxn;


int Find(int x){
    int p = x;
    while(tree[x].pre != x){
        x = tree[x].pre;
    }
    while(tree[p].pre != p){
        p = tree[p].pre;
        tree[p].pre = x;
       
    }
    return x;
}


void Join(int x,int y){
    int fx = Find(x);
    int fy = Find(y);
    if(fx != fy){
        tree[fy].rank += tree[fx].rank;
        if(tree[fy].rank > maxn){
            maxn = tree[fy].rank;
        }
        tree[fx].pre = fy;
    }
}


int main(){
    int n;
    int i,j;
    int x,y;


    while(scanf("%d",&n) != EOF){
        maxn = 1;
        for(i = 0;i < 10000005;i++){
            tree[i].pre = i;
            tree[i].rank = 1;
        }
        for(i = 0;i < n;i++){
            scanf("%d%d",&x,&y);
            Join(x,y);
        }
        printf("%d\n",maxn);
    }
    return 0;
}