More is better

最新推荐文章于 2019-06-29 14:23:40 发布

要认认真真

最新推荐文章于 2019-06-29 14:23:40 发布

阅读量243

点赞数

分类专栏：并查集

本文链接：https://blog.csdn.net/dy476813515/article/details/27186161

版权

并查集专栏收录该内容

9 篇文章 0 订阅

订阅专栏

More is better

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

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

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<stdio.h>
int tree[10000001];
int root[10000001];
void init(){
   for(int i=1;i<10000001;i++){
       tree[i]=i;
       root[i]=0;
   }
}
int findx(int x)//压缩路径
{
    if(x!=tree[x]){
        tree[x]=findx(tree[x]);
    }
    return tree[x];
}

int findx1(int x)//普通版
{
    int r;
    r=x;
    while(tree[r]!=r)
        r=tree[r];
    return r;
}

void merge(int x,int y){
   int fx=findx(x);
   int fy=findx(y);
   if(fx!=fy){
       tree[fy]=fx;
   }
}
int main(){
    freopen("in.txt","r",stdin);
    int zu;
    while(scanf("%d",&zu)!=EOF){
       init();
       int zuu=zu;
       while(zu--){
           int a,b;
           scanf("%d%d",&a,&b);
           merge(a,b);
       }
       int max=0;
       for(int i=1;i<=2*zuu;i++){
           int roott=findx(i);
           root[roott]++;
           if(root[roott]>max){
               max=root[roott];
           }
       }
       if(max==0){
           max=1;
       }
       printf("%d\n",max);
    }
    return 0;
}