More is better
来源:互联网 发布:opera linux 安装 编辑:程序博客网 时间:2024/06/06 06:47
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
42
#include<stdio.h> #define N 10000000 int 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)/*合并a和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
- HDOJ More is better
- hdu More is better
- More is better
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- HDU1856:More is better
- hdu1856 More is better
- H - More is better
- More is better
- More is better
- More is better
- More is better
- C - More is better
- hdu1856 More is better
- More is better
- More is better 1856
- 2130:More is better
- 程序员之路——一个老程序员对刚上大学的学弟学妹的忠告
- k8s源码分析-----kubelet启动流程分析(续)
- 论文笔记 A MultiPath Network for Object Detection
- android如何查看cpu的占用率和内存泄漏
- 二叉树的遍历之——Morris遍历
- More is better
- 微信公众号开发---基本原理及注册
- 浅谈集合转换成数组的方法--toArray()与toArray(T[] a)
- Web安全测试中常见逻辑漏洞解析(实战篇)
- sort() 的随机排列(不靠谱)
- TCP与UDP的不同接包处理方式
- Android中的内存泄漏
- 【图论】【宽搜】【染色】NCPC 2014 A Ades
- LeetCode:Integer Break