当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1856：More is better

题目描述
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.
输入解释
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)
输出解释
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
输入样例 
4
1 2
3 4
5 6
1 6
4
1 2
3 4
5 6
7 8
输出样例 
4
2
提示
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.
来自杭电HDUOJ的附加信息
Author lxlcrystal@TJU
Recommend lcy
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 HDU 2007 Programming Contest - Final
源链接： HDU-1856
最后修改于 2020-10-25T22:48:20+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
5000/1000MS(Java/Others) 327680/102400K(Java/Others)