항 저 우 전 1856 및 수집 경로 압축 + 순위 에 따라 합병

          이 문 제 는 오후 에 봤 는데 그 때 는 못 봤 어 요. 나중에 알고리즘 서론 에 있어 서 다른 자 료 를 보고 풀 었 어 요.그런데 항 저 우 전기 데이터 구덩이 아버지,, n = 0 의 상황 이 있어 서 저 를 여러 번 wr 시 켰 어 요......................................................제목:
More is better
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others) Total Submission(s): 4078    Accepted Submission(s): 1511
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. 
    
   
   
   
   

ac 코드:

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
const int N=10000005;
int maxx,father[N],rankk[N];
void init(int x){
  for(int i=0;i<N;++i)
  {father[i]=i;rankk[i]=1;}
}
int find(int x){
  if(father[x]!=x)
	  father[x]=find(father[x]);
  return father[x];
}
void unionset(int a,int b){
  int x=find(a);
  int y=find(b);
 
  if(x==y)
	  return;
  if(rankk[x]>=rankk[y]){
    father[y]=x;
	rankk[x]+=rankk[y];
	if(rankk[x]>maxx)
		maxx=rankk[x];
	
  }
  else{
    father[x]=y;
	rankk[y]+=rankk[x];
	if(rankk[y]>maxx)
		maxx=rankk[y];
	
  }
}
int main(){
  int n;
  while(scanf("%d",&n)!=EOF){
	  if(n==0)
	  { printf("1
");continue;}
    init(n);
	maxx=0;
	int a,b;
	while(n--){
	  scanf("%d%d",&a,&b);
	  unionset(a,b);
	}
	printf("%d
",maxx);
  }
  return 0;
}