程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> HDU 1856 More is better (並查集)

HDU 1856 More is better (並查集)

編輯:C++入門知識

HDU 1856 More is better (並查集)


#include  
#include

 
int ff[100005];//ff[x]表示x的父節點 
int ss[100005];//
int x[100005],y[100005];

void ii(int n)    //初始化   
{  
    for(int i=1;i<=n;i++) 
	{ 
        ff[i]=i;     
        ss[i]=1;   //
    } 
}  
  
int dd(int x)    //帶路徑壓縮的查找
{  
    if(x!=ff[x])
		ff[x]=dd(ff[x]);
	return ff[x];	
} 

void cc(int a,int b)    //合並
{  
    ff[a] = b;
    ss[b] += ss[a];
}  

int main()  
{  
    int i,m,a,b,t,k,j,N;
	int count,max=0;
    while(~scanf("%d",&N)) 
	{
       for(i=1;i<=N;i++)
	   {
            scanf("%d%d",&x[i],&y[i]);
			if(x[i]>max) max = x[i];  
            if(y[i]>max) max = y[i];  
	   }
	   ii(max);
	   for(i=1;i<=N;i++)
	   { 
		   int ta=dd(x[i]);  
           int tb=dd(y[i]); 
		   if(ta!=tb)
		     cc(ta,tb);
	   }
	   int ans=0;
	   for (i=1;i<=max;i++)
	   {
		   if(ss[i] > ans)
			   ans = ss[i];
	   }
        printf("%d\n",ans);
    }  
    return 0;  
} 

並查集的運用

 

More is better

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



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

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved