hdoj-1856-More is better【并查集】
来源:互联网 发布:淘宝会员名跟昵称区别 编辑:程序博客网 时间:2024/05/01 23:18
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 18427 Accepted Submission(s): 6779
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
Recommend
lcy | We have carefully selected several similar problems for you:1325 1102 1301 1829 1811
#include<stdio.h>#include<string.h>#include<algorithm>int maxn=-1;using namespace std;int root[10000001];int res[10000001];int find(int i){if(root[i]==i) return i;return root[i]=find(root[i]);}void unio(int x,int y){int p=find(x),q=find(y);if(p<=q) root[q]=p,res[p]+=res[q],maxn=max(maxn,res[p]); // 在合并的时候顺便查找最大值,减少时间开销,否则超时!!!else root[p]=q,res[q]+=res[p],maxn=max(maxn,res[q]);return;}int main(){int n;while(~scanf("%d",&n)){if(n==0){printf("1\n");continue;}memset(res,0,sizeof(res));int i,x,y,a,b;maxn=-1;for(i=1;i<=10000000;++i) root[i]=i,res[i]=1;for(i=1;i<=n;++i){scanf("%d%d",&a,&b);x=find(a);y=find(b);if(x!=y){unio(x,y);}}printf("%d\n",maxn);}return 0;}
0 0
- 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 (带权并查集)
- (并查集)More is better--HDOJ
- hdoj problem 1856 More is better(并查集||动态规划)
- hdoj 1856 More is better 【并查集 求最大节点数】
- HDOJ 1856 More is better(并查集,记录树的节点数)
- HDOJ 1856 More is better (并查集 + 压缩路径 + 结点深度)
- hdoj 1856 More is better 【并查集 求最大节点数】
- 北国之春
- 关于PL\SQL无法在64位Client下使用的原因及解决办法
- OC-值对象, NSSet, NSDate
- NYOJ-111分数加减法
- IOS - 1 - 开发环境的搭建
- hdoj-1856-More is better【并查集】
- JavaSE Socket发送文件
- Multiply Strings
- webstorm注册码
- 双向链表
- chrome开发工具
- Spring(六)使用构造器装配属性
- mysql存储过程详解
- 算法排序 -- 选择排序