HDU 1856
来源:互联网 发布:怎样在淘宝买岛国片 编辑:程序博客网 时间:2024/05/16 14:28
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 6073 Accepted Submission(s): 2225
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
#include"stdio.h"int p[10000010], num[10000010]={0};int find(int x){ int k, j, r; r = x; while(r != p[r]) r = p[r]; k = x; while(k != r) //注意这里的路径压缩 { j = p[k]; p[k] = r; k = j; } return r;}long count (){ long i, max = 0 ; for (i = 1 ; i <= 10000000 ; i++) num[i] = 0 ; for (i = 1 ; i <= 10000000 ; i++) num[find(i)]++ ; //用数组存放 for (i = 1 ; i <= 10000000 ; i++) if (num[i] > max) max = num[i] ; return max ;}int main(){ long n, p1, p2, i, max = 0, j, cnt; while(scanf("%d", &n) != EOF) { for(i = 1; i <= 10000000; i++) p[i] = i; i = 1; while(i <= n) { scanf("%ld%ld", &p1, &p2); if(find(p1) != find(p2)) { p[find(p2)]=find(p1); } i++; } printf("%ld\n", count()); } return 0;}
- HDU 1856
- HDU 1856
- HDU 1856
- hdu 1856
- hdu 1856
- HDU 1856
- hdu 1856
- hdu 1856
- HDU 1856
- hdu 1856
- hdu 1856
- hdu 1856
- hdu-1856
- hdu 1856
- hdu 1856
- hdu 1856
- hdu--1856
- HDU 1856
- 数据结构与算法之—数组(二)
- ORACLE 数据查询集合即:查询结果的集合操作 并集 交集 差集
- mysql aud - it访问日志记录
- jQuery 插件之Checkbox
- jsp <c:set>标签的使用
- HDU 1856
- 下拉框 单选按钮
- 自主学习——四步法
- jstl c:foreach的用法
- POJ 2653 Pick-up sticks
- 20120722 openSUSE下java相关
- 问几个小问题!!
- 敏捷开发之道
- Android 入门笔记 之 网址