hdu1856 More is better(并查集)
来源:互联网 发布:搞笑的淘宝收货人名字 编辑:程序博客网 时间:2024/05/29 04:25
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 11722 Accepted Submission(s): 4342
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<stdio.h>#include<string.h>int pre[10000004],num[10000004];int ans;int find(int a){ while(pre[a]!=a) a=pre[a]; return a;}void uni(int a,int b){ int x=find(a),y=find(b); if(x==y) return; if(num[x]<num[y]) { int r=x; x=y; y=r; } pre[y]=x; num[x]+=num[y]; if(num[x]>ans) ans=num[x];}int main(){ int n,i,t,a,b; while(scanf("%d",&n)!=EOF) { for(i=1; i<=10000000; i++) { pre[i]=i; num[i]=1; } ans=1; for(t=0; t<n; t++) { scanf("%d%d",&a,&b); uni(a,b); } printf("%d\n",ans); } return 0;}
0 0
- More is better hdu1856 并查集
- hdu1856 ,More is better,并查集
- Hdu1856 - More is better - 并查集
- HDU1856 More is better 并查集
- HDU1856 More is better 并查集
- hdu1856 More is better 并查集
- HDU1856 More is better(并查集)
- hdu1856 More is better 并查集
- hdu1856 More is better--并查集
- hdu1856 More is better 并查集
- HDU1856(More is better)—并查集+树
- hdu1856 More is better(并查集)
- hdu1856 More is better(并查集 )
- hdu1856 More is better (并查集)
- More is better--hdu1856(并查集)
- HDU1856 More is better(并查集)
- HDU1856 More is better(并查集)
- HDU1856:More is better(并查集)
- 我的学习之旅:android文件下载功能的实现
- How to Build ffmpeg with NDK r9
- Java命令行运行参数说明大全(偷来的)
- ArrayBlockingQueue 实现线程同步效果例子
- POJ 2182 Lost Cows
- hdu1856 More is better(并查集)
- 设置 quick-cocos2d-x 在 Mac 下的编译环境
- PHP5 session 详解【经典】
- 图像配准实现代码VC6.0移植VC2010问题总结
- DBL_EPSILON和 FLT_EPSILON的用法
- MySQL Replace INTO的使用
- 题意:给两个序列(长度达10^5,序列内的数都不同且都小于10^5),求这两个序列的最长公共序列的长度
- php处理cnd 创建11.bat批处理文件
- iOS:自定义UIBarButtonItem