More is better(简单并查集)
来源:互联网 发布:omarion知乎 编辑:程序博客网 时间:2024/05/21 09:39
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 24367 Accepted Submission(s): 8746
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.
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
41 23 45 61 641 23 45 67 8
Sample Output
42HintA 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
题意总结一下就是找最大集合中的元素个数;;;
#include<cstdio>#include<cstdlib>int max(int a,int b)<span style="white-space:pre"></span>//不知道为啥用#include<algorithm>就编译错误;只能自定义max了{if(a>b)return a;return b;}int fu[10000010],rank[10000010],sum;void chu(){for(int i=1;i<=10000010;i++){fu[i]=i;rank[i]=1;}}int root(int x){if(x!=fu[x]){fu[x]=root(fu[x]);}return fu[x];}void Union(int x,int y){int fx=root(x);int fy=root(y);if(fx!=fy){fu[fx]=fy;rank[fy]=rank[fy]+rank[fx];<span style="white-space:pre"></span>//通过每次更新最后求得最大集合中的人数;sum=max(sum,rank[fy]);}}int main(){int t,a,b;while(scanf("%d",&t)!=EOF){if(t==0)<span style="white-space:pre"></span>//还有0{printf("1\n");continue;}chu();sum=0;while(t--){scanf("%d %d",&a,&b);Union(a,b);}printf("%d\n",sum);}return 0;}
0 0
- More is better(简单并查集)
- More is better(并查集)
- more is better(并查集)
- More is better (并查集)
- More is better (并查集)
- More is better(并查集)
- More is better (并查集)
- HDU 1856 More is better(简单并查集) 【最大并查集人数模板】
- More is better hdu1856 并查集
- hdu1856 ,More is better,并查集
- 并查集C - More is better
- HDOJ1856 More is better 【并查集】
- Hdu1856 - More is better - 并查集
- HDU1856 More is better 并查集
- 并查集 HDOJ1856 More is better
- HDU1856 More is better 并查集
- More is better---并查集实践
- More is better(并查集)
- 习题二
- HTTP的get、put、post、delete
- 图不连接时怎么完成遍历?
- 开启愉快的码农旅程
- poj 1741 Tree(树的分治)
- More is better(简单并查集)
- android-布局
- poj2522 Frogger(最短路变形 所有路径中最长边的最小值)
- 如何读取项目里的.properties文件
- MD5加密
- iOS开发之AFNetworking 3.0 使用
- QTP 无法识别web对象原因
- 二叉树简介
- HDU 1272 小希的迷宫【并查集判断无向图回路】