HDU 1856 More is better
来源:互联网 发布:淘宝手机降价通知 编辑:程序博客网 时间:2024/06/10 17:44
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 26984 Accepted Submission(s): 9656
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.
#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;int n;int f[10000005];int p[10000005];void into(){ for(int i=1; i <= 10000002; i++) { f[i] = i; p[i] = 1; }}int find(int x){ return f[x] == x? x : f[x] = find(f[x]);}int megeral(int x,int y){ x = find(x); y = find(y); if(x!=y) { f[x] = y; p[y] += p[x]; ///将记录的个数累加到父节点上 } return 0;}int main(){ while(~scanf("%d",&n)) { if(n==0) { printf("1\n"); continue; } into(); int a,b,m=0; for(int i=0; i<n; i++) { scanf("%d%d",&a,&b); m = max(a,m); m = max(b,m); megeral(a,b); } int ans=0; for(int i=1; i<=m; i++) ans = max(ans,p[i]); printf("%d\n",ans); } return 0;}
0 0
- hdu 1856 More is better
- HDU 1856 more is better
- Hdu-1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu-1856 More is better
- vue v-for index下标中文网挖的坑
- 最大连续数字长度
- Tab Control使用方法
- new
- poj2502 关于输入部分的坑。。
- HDU 1856 More is better
- 牛客网前端大挑战修改this指向
- VMWare装CentOS 7
- Android业务组件化之子模块SubModule的拆分以及它们之间的路由Router实现
- 翻转数组
- java 四舍五入
- poj 1442 Black Boxes(treap)求第k大数的treap模板
- 线段树+dfs HDU
- 转一波收藏吧