HDJ 1856 More is better
来源:互联网 发布:余佳文 知乎 编辑:程序博客网 时间:2024/06/06 12:20
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 24651 Accepted Submission(s): 8849
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>#define N 10000000int father[N],num[N];void initial(){int i;for(i=1;i<=N;i++){father[i]=i;num[i]=1;/*开始时数量都为1,根节点为自己*/}}int find(int x) {if(father[x]!=x)father[x]=find(father[x]);return father[x];}void merge(int a,int b){int p=find(a);int q=find(b);if(p!=q){father[p]=q;num[q]+=num[p];/*亮点*/}}int main(){int n,a,b,i,sum,max;while(~scanf("%d",&n)){if(n==0){printf("1\n");continue;}max=0;initial(); for(i=0;i<n;i++){scanf("%d%d",&a,&b);if(a>max)max=a;if(b>max)max=b;/*求男生数量*/ merge(a,b);}int Max=0;for(i=1;i<=max;i++)if(num[i]>Max) /*查找最大值*/Max=num[i];printf("%d\n",Max);}return 0;}
0 0
- HDJ 1856 More is better
- More is better 1856
- 1856 More is better
- hdu 1856 More is better
- HDU 1856 more is better
- HDOJ 1856 More is better
- Hdu-1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDOJ 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- UVA-1587
- 2568. 【NOIP2011模拟9.17】地铁建设 (Standard IO)
- 省市县多级联动
- JavaScript学习笔记(一)——核心语法
- SDUT OJ数据结构实验图论一:基于邻接矩阵的广度优先搜索遍历
- HDJ 1856 More is better
- 温故知新-Dialogs学习笔记
- https安全在哪里,原理是什么?
- 我的Anrdoid之旅(十二)---RollPagerView的使用方法
- 并发编程八:volatile关键字
- atsha204a加密芯片使用攻略——配置篇
- 数组去重的两种方式
- Piggy-Bank hd 1114 (完全背包)
- java允许请求跨域访问