HDOJ 1856 More is better 简单的并查集算法

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.
 
   
   
   
    
  
  

 

 

Author

lxlcrystal@TJU

 

 

Source

HDU 2007 Programming Contest - Final

 

 

Recommend

lcy

 

 

在一些有N个元素的集合应用问题中，我们通常是在开始时让每个元素构成一个单元素的集合，然后按一定顺序将属于同一组的元素所在的集合合并，其间要反复查找一个元素在哪个集合中。这一类问题近几年来反复出现在信息学的国际国内赛题中，其特点是看似并不复杂，但数据量极大，若用正常的数据结构来描述的话，往往在空间上过大，计算机无法承受；即使在空间上勉强通过，运行的时间复杂度也极高，根本就不可能在比赛规定的运行时间（1～3秒）内计算出试题需要的结果，只能采用一种全新的抽象的特殊数据结构——并查集来描述。

 

做几个题目，体会体会就OK了

#include <iostream> #define N 100005 using namespace std; int MAX; struct node { int parent; int rank; }elem[N]; void init() // 初始化 { int i; for(i=0;i<N;i++) { elem[i].parent=i; elem[i].rank=1; } } int find(int x) { int root,temp; temp=x; while(elem[x].parent!=x) // 找到根节点 { x=elem[x].parent; } root=x; x=temp; while(elem[x].parent!=x) // 压缩路径，路劲上的点直接指向 根节点 { temp=elem[x].parent; elem[x].parent=root; x=temp; } return root; } void uni(int a,int b) // 合并 { int x,y; x=find(a); y=find(b); if(elem[x].rank>=elem[y].rank) { elem[y].parent=elem[x].parent; elem[x].rank+=elem[y].rank; if(MAX<elem[x].rank) MAX=elem[x].rank; } else { elem[x].parent=elem[y].parent; elem[y].rank+=elem[x].rank; if(MAX<elem[y].rank) MAX=elem[y].rank; } } int main() { int n,x,y,a,b,i; while(scanf("%d",&n)!=EOF) { init(); MAX=1; for(i=0;i<n;i++) { scanf("%d%d",&a,&b); x=find(a); y=find(b); if(x!=y) uni(a,b); } cout<<MAX<<endl; } }