HDOJ 1856 More is better(并查集,记录树的节点数)
来源:互联网 发布:手机微信连接不上网络 编辑:程序博客网 时间:2024/04/29 20:17
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 18606 Accepted Submission(s): 6845
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.
并查集,查找节点数最多的树的节点的个数,注意当n等于0时,输出为1,这个略坑。
代码如下:
#include<cstdio>#define max 10000010int tree[max];int father[max],count;int find(int x){int r=x;int t;while(r!=tree[r]) r=tree[r];while(x!=r)//注意压缩路径,否则超时 {t=tree[x];tree[x]=r;x=t;}return r;}void megre(int a,int b){int fa,fb;fa=find(a);fb=find(b);if(fa!=fb){tree[fa]=fb;father[fb]+=father[fa];//记录每棵树的节点数 if(father[fb]>count) count=father[fb];}}int main(){int n,i,a,b;while(scanf("%d",&n)!=EOF){count=1;for(i=1;i<max;i++){tree[i]=i;father[i]=1;//注意初始化 }while(n--){scanf("%d%d",&a,&b);megre(a,b);}printf("%d\n",count);}return 0;}
0 0
- 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 题目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&&POJ-1611(并查集)
- HDOJ 1856 More is better(并查集)
- HDOJ 1856 More is better (并查集)
- HDOJ 1856 More is better (带权并查集)
- HDU 1856 More is better(越多越好,并查集,节点的个数)
- C++ math.h函数
- 在结构体中定义另一个结构体类型变量可以吗
- android监听器
- windows下mysql5.6.20使用mysqldumpslow.pl分析慢日志
- mysql 连接php中文乱码
- HDOJ 1856 More is better(并查集,记录树的节点数)
- JSONObject与JSONArray的使用
- Spring3+mybatis+mysql整合详解(三)
- MySql的优化措施一
- php读取excel中的时间转换问题
- hdu5325(2015多校3)--Crazy Bobo(dfs)
- linux压缩与解压缩 tar命令
- Spring3+mybatis+mysql整合详解(四)
- 设计HEVC/H.265硬件视频编码器难点