hdu1856More is better 并查集基础
来源:互联网 发布:李煌 知乎 编辑:程序博客网 时间:2024/05/21 15:40
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 2618 Accepted Submission(s): 1006
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
42这一题告诉我们如何统计集合中的元素个数,这里的rank[i],表示的不再是i结点的深度,而是i所在集合中的元素个数HintA 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.因此,与模板有些不同
- hdu1856More is better 并查集基础
- hdu1856More is better基础并查集
- 【并查集】HDU1856More is better
- HDU1856More is better(并查集)
- hdu1856More is better【并差集】
- hdu1856More is better
- hdu1856More is better
- HDU1856More is better
- hdu 1856 More is better(并查集基础)
- 1856-More is better-基础并查集
- HDU 1856 More is better(基础并查集)
- HDU 1856 More is better 基础并查集★
- hdu 1856 More is better 基础并查集★
- More is better hdu1856 并查集
- hdoj_1856More is better(并查集)
- hdu1856 ,More is better,并查集
- 并查集C - More is better
- HDOJ1856 More is better 【并查集】
- 百度知道小偷php版11年3月最新版
- 配置Android在MyEclipse下的开发环境
- 一个人
- ava.lang.UnsatisfiedLinkError: CC错误有以下几种原因和处理方法
- 读《C语言程序设计实用教程 - 高职高专计算机任务驱动模式教材》有感
- hdu1856More is better 并查集基础
- SQL Server应用
- 注册成功
- 【转载】嵌入式系统学习的分类和就业
- 关于XMLHTTP的细节可以参考
- 靠 头像非本人 网上找的 很久的了 一直改不了 什么时间可以改?
- 截屏函数,包含DDBtoDIB
- php中include和require的区别
- 汇编--INT 10H