HDOJ 1856 More is better (并查集)
来源:互联网 发布:win10多核优化 2017 编辑:程序博客网 时间:2024/04/29 05:04
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 19234 Accepted Submission(s): 7075
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.
说明: 求 所有 根节点中 ,集合中元素最多的个数.
第一个 例子: {1,2,5,6} {3,4} 最多的是 4;
第二个例子: {1,2} {3,4} {5,6} {7,8} 最多的是 2。
注意: 压缩路径 否则超时,不能AC ; N为 0 ,要输出 1 ,因为集合中最少有一个元素(自身),
已AC代码:
#include<cstdio>#define M 10000000#define max(x,y) (x > y ? x : y)int num[M+10],per[M+10];void itoa(){for(int i = 1; i < M+10; ++i){per[i] = i;num[i] = 1; //初始每个集合中有一个元素 }}int find(int x) //压缩路径 否则超时,不能AC { //把 一个集合中所有节点 连到 根节点上 return x == per[x] ? x : per[x] = find(per[x]);}void join(int a,int b){int fa = find(a);int fb = find(b);if(fa != fb){per[fa] = fb;num[fb] += num[fa]; // 计算合并后的元素个数 }}int main(){int n,i,a,b,m;while(scanf("%d",&n)!=EOF){if(n == 0) // n 为 0 ,要输出 1 {printf("1\n");continue;}itoa(); //初始化 m=0;for(i = 0; i < n; ++i){scanf("%d%d",&a,&b);join(a,b); // 加入 集合 m = max(m,max(a,b)); // 最大的编号 }int MAX = 0;for(i = 1;i <= m; ++i) // 元素最多的集合 if(num[i] > MAX)MAX = num[i];printf("%d\n",MAX);}return 0;}
0 0
- HDOJ 题目1856More is better(并查集)
- hdoj 1856 More is better(并查集)
- HDOJ 1856 More is better (并查集)
- HDOJ 1856 More is better(并查集)
- HDOJ--1856--More is better【并查集】
- hdoj-1856-More is better【并查集】
- HDOJ 1856 More is better (并查集)
- hdoj 1856 More is better [并查集]
- hdoj 1856 More is better 【并查集】
- HDOJ-1856 More is better&&POJ-1611(并查集)
- HDOJ 1856 More is better (并查集)
- HDOJ 1856 More is better (带权并查集)
- (并查集)More is better--HDOJ
- HDOJ 1856 More is better (并查集 + 压缩路径 + 结点深度)
- More is better(并查集)
- more is better(并查集)
- More is better (并查集)
- More is better (并查集)
- Extjs按钮的隐藏、显示、禁用,启用,去除加载朦层
- tabBar颜色修改
- 每周学一点 egret(1): wing IDE 使用注意点
- 过滤特殊危险字符
- POJ 3177--Redundant Paths【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
- HDOJ 1856 More is better (并查集)
- 杭电3790最短路径问题
- 文章标题
- 使用shell定时备份文件
- 理解Linux系统中的load average(图文版)
- 机器学习数据源
- Ajax学习小结
- json_encode处理中文乱码
- TextView加载html文本