hdoj1856 More is better(并查集)
来源:互联网 发布:cms上传文件 编辑:程序博客网 时间:2024/05/04 22:02
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 18729 Accepted Submission(s): 6881
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.【代码】#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;#define maxn 10001000int i,n,sum;int per[maxn],ran[maxn];void init(){sum=0;for(i=1;i<=10000000;i++){per[i]=i; ran[i]=1;}}int find(int x){if(x==per[x]) return x;return 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;ran[fb]+=ran[fa];sum=max(sum,ran[fb]);}}int main(){while(scanf("%d",&n)!=EOF){init();if(n==0){printf("1\n");continue;}while(n--){ int a,b;scanf("%d%d",&a,&b); join(a,b);}printf("%d\n",sum);}return 0;}
0 0
- HDOJ1856 More is better 【并查集】
- 并查集 HDOJ1856 More is better
- hdoj1856 More is better(并查集)
- 子树包含了多少个节点(并查集)——czy的工程VS hdoj1856 More is better
- More is better<hdoj1856>
- More is better(并查集)
- more is better(并查集)
- More is better (并查集)
- More is better (并查集)
- More is better(并查集)
- More is better (并查集)
- More is better hdu1856 并查集
- hdu1856 ,More is better,并查集
- 并查集C - More is better
- Hdu1856 - More is better - 并查集
- HDU1856 More is better 并查集
- HDU1856 More is better 并查集
- More is better---并查集实践
- 由于OSPF防环检查导致的虚拟防火墙学习不到OSPF路由的案例
- 今日待解决问题
- 我对cocos2dx的理解和总结
- 轨道机动算法的C++实现
- Eclipse开发Web应用经典错误整理(持续更新中...)
- hdoj1856 More is better(并查集)
- php设计模式入门-单例模式
- Sort Colors
- EF学习和使用(二)ModelFirst
- Leetcode刷题总结
- 众数问题
- java ee中使用dbcp
- STP/RSTP/MSTP的区别以及各自的特点
- java语言基础总结