HDU1856:More is better
来源:互联网 发布:电机数据大全安装尺寸 编辑:程序博客网 时间:2024/06/10 17:30
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.
//因为要找最大的,所以用num来记载所有情况,在比较找出最大的
#include <stdio.h>struct A{ int num; int pre;} set[10000005];void bulid(int n){ int i; for(i = 1; i<=n; i++) { set[i].pre = i; set[i].num = 1; }}int find(int x){ if(set[x].pre == x) return x; return set[x].pre = find(set[x].pre);}void Union(int x,int y){ set[x].pre = y; set[y].num+=set[x].num;}int main(){ int big,n,f1,f2,i; int x[100005],y[100005]; while(~scanf("%d",&n)) { big = 0; int ans = 0; if(n==0) { printf("1\n"); continue; } for(i = 1; i<=n; i++) { scanf("%d%d",&x[i],&y[i]); if(x[i]>big) big = x[i]; if(y[i]> big) big = y[i]; } bulid(big); for(i = 1; i<=n; i++) { f1 = find(x[i]); f2 = find(y[i]); if(f1!=f2) Union(f1,f2); } for(i = 1; i<=big; i++) { if(set[i].num > ans) ans = set[i].num; } printf("%d\n",ans); } return 0;}
- 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
- More is better hdu1856 并查集
- HDU1856 More is better 解题报告
- hdu1856 ,More is better,并查集
- js判断单元格没有图片和内容
- 七大排序算法系列之直接插入排序
- 【转】KVM/JVM和Dalvik
- writeback机制源码分析
- GetLastError错误代码含义
- HDU1856:More is better
- .NET混淆器Dotfuscator的五大看点
- 关于multiset中遇到的一个错误
- 读老罗的Android之旅中hello的例子编写整理
- session与cookie的区别
- Direct Load Data时当前session无法查询与修改的原因
- MYSQL 浅谈MyISAM 存储引擎
- 如何说服开发人员和设计师加入你的创业团队
- 提高flex应用性能方法