HDU 1856 More is better
来源:互联网 发布:间接网络外部性 编辑:程序博客网 时间:2024/05/29 08:31
DescriptionMr 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. InputThe 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) OutputThe 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 42 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.
#include<cstdio>const int maxn=100000000+10;int fa[maxn],rank[maxn];int a[maxn],b[maxn];int find(int i){ return i==fa[i]?fa[i]:fa[i]=find(fa[i]);}int main(){ int n,m1,m; while(~scanf("%d",&n)) { m=1;//一定不能赋值为0,WA了好多次啊 for(int i=1;i<=n;i++) { scanf("%d%d",&a[i],&b[i]); m1=a[i]>b[i]?a[i]:b[i]; m=m>m1?m:m1; } for(int i=1;i<=m;i++) { fa[i]=i; rank[i]=1; } int ans=0; for(int i=1;i<=n;i++) { int x=find(a[i]); int y=find(b[i]); if(x!=y) { fa[x]=y; rank[y]+=rank[x]; } } for(int i=1;i<=m;i++) if(i==fa[i]) if(ans<rank[i]) ans=rank[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
- 程序员面试题目总结--树(一)【重建二叉树、二叉树的深度、树的子结构、二叉树中和为某一值得路径、从上往下打印二叉树】
- Xshell自动断开连接解决办法
- Spring-SpringMVC-Mybatis整合
- emacs的org-mode模式的链接
- The stack `XdataStack`()is outside the stack range
- HDU 1856 More is better
- 插入排序(insert sort)
- HDU4035 Maze 概率DP+图
- 线段树zoj3635
- 数码视讯非研发类考题
- zoj 3818 2014牡丹江网赛
- HDU4706 根据题目读题写程序
- C#判断点在直线上的方法
- STL algorithm算法copy_n(9)