HDU1856:More is better(并查集)
来源:互联网 发布:linux安装tomcat8 编辑:程序博客网 时间:2024/05/18 19:21
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 25930 Accepted Submission(s): 9308
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.
Author
lxlcrystal@TJU
Source
HDU 2007 Programming Contest - Final
并查集入门
# include <stdio.h># include <algorithm># define MAXN 10000000using namespace std;int pre[MAXN+1], num[MAXN+1];void init(){ for(int i=1; i<=MAXN; ++i) { pre[i] = i; num[i] = 1; }}int find(int x){ if(x != pre[x]) pre[x] = find(pre[x]); return pre[x];}int main(){ int n, x, y, imax; while(~scanf("%d",&n)) { if(n==0) { puts("1"); continue; } init(); imax = -1; while(n--) { scanf("%d%d",&x,&y); int px = find(x); int py = find(y); if(px != py) { pre[px] = py; num[py] += num[px]; imax = max(imax, num[py]); } } printf("%d\n",imax); } 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(并查集)
- 剑指offer-和为S的两个数组-两根指针
- 杨氏矩阵
- Codeforces 766D 并查集
- DataGridView中将column与数据库表对应的属性
- 389. Find the Difference | 找字符串中的不同
- HDU1856:More is better(并查集)
- 图像卷积与滤波的一些知识点
- 记录一个breed服务器地址
- 洛谷 1449——后缀表达式(线性数据结构)
- 第二章 Spring MVC入门
- 函数注册与回调实例
- struts.xml配置问题
- tensorflow的安装教程(基于Ubuntu)
- 【jzoj4264】【tty妹子的函数】