HDU 1856 More is better
来源:互联网 发布:php 模拟http请求 编辑:程序博客网 时间:2024/05/18 01:34
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 21423 Accepted Submission(s): 7805
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: 1213 1325 1879 1102 1198
判断节点最多的
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int pre[10000010],ran[10000010];int flag;int find(int x){if(x==pre[x])return x;return pre[x]=find(pre[x]);}void merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){ran[fy]+=ran[fx];pre[fx]=fy;if(flag<ran[fy])flag=ran[fy]; } }int main(){int n,i,j,a,b;while(scanf("%d",&n)!=EOF){flag=1;for(i=1;i<10000010;i++){pre[i]=i;ran[i]=1;//初始化 }for(i=1;i<=n;i++){scanf("%d%d",&a,&b);merge(a,b);}printf("%d\n",flag);}}
0 0
- 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
- 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
- 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
- Intent和Intent过滤器
- HDU 3038 - How Many Answers Are Wrong
- POJ1523--SPF--tarjan--割点--分块
- Java面试题多思路解析--有一个已经排好序的数组。现输入一个数,要求按原来的规律将它插入数组中
- jQuery 实现页面关键字查询
- HDU 1856 More is better
- 腾讯电话面试总结
- poj 3723 Conscription(最大生成树)
- bzoj2143 飞飞侠 最短路
- verilog的小数问题
- 优雅的实现图片翻转(js实现)
- iOS开发---判断字符串为汉字或字母,并计算其数字个数
- A Famous Music Compose
- hdu 3460 Ancient Printer 解题报告