2130: More is better
题目描述
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
ps:其它的没什么好说的,记说一点,该题目中要求并查集中元素的个数,其实我之前的思路跟现在差不多,只是我那种没有实现,而且,这种我觉得更简单。
代码:#include<cstdio> #include<cstdlib> #include<climits> const int N=1e5+10; int far[N]; int make[N]; int maxx; int fd(int x) { int a=x; while(x!=far[x]) x=far[x]; while(a!=far[a]) { int z=a; a=far[a]; far[z]=x; } return x; } void init() { for(int i=1;i<=N;i++) { far[i]=i; make[i]=1; } } void Union(int a,int b) { int faA=fd(a); int faB=fd(b); if(faA!=faB) { far[faA]=faB; make[faB]+=make[faA];//从根节点开始计数,更新根节点,得到该根节点下元素的个数。 if(make[faB]>maxx) maxx = make[faB]; } } int main() { int n,a,b; while(~scanf("%d",&n)) { if(n==0) { printf("1\n"); continue; } init(); maxx=INT_MIN; for(int i=1;i<=n;i++) { scanf("%d%d",&a,&b); Union(a,b); } printf("%d\n",maxx); } }