HDU 1856 More is better
来源:互联网 发布:开淘宝步骤 编辑:程序博客网 时间:2024/05/14 13:13
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1856
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 22471 Accepted Submission(s): 8180
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
思路:并查集的运用。找出各个集合的最大元素个数。
附上AC代码:
#include <bits/stdc++.h>//#pragma comment(linker, "/STACK:102400000, 102400000")using namespace std;const int maxn = 10000005;int p[maxn];int n;int _find(int x){return p[x]<0 ? x : _find(p[x]);}void _union(int x, int y){x = _find(x);y = _find(y);if (p[x] < p[y]){p[x] += p[y];p[y] = x;}else{p[y] += p[x];p[x] = y;}}int main(){#ifdef LOCALfreopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);#endifwhile (~scanf("%d", &n)){if (0 == n){printf("1\n");continue;}memset(p, -1, sizeof(p));int minid=INT_MAX, maxid=-INT_MAX;int x, y;while (n--){scanf("%d%d", &x, &y);minid = min(minid, x);minid = min(minid, y);maxid = max(maxid, x);maxid = max(maxid, y);x = _find(x);y = _find(y);if (x != y)_union(x, y);}int ans = 0;for (int i=minid; i<=maxid; ++i)ans = min(ans, p[_find(i)]);printf("%d\n", -ans);}return 0;}
1 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
- 新诗
- 算法复杂度函数级T(n)非O(n)分析
- java 调用shell命令
- 3、面向对象接口
- FISTA的由来:从梯度下降法到ISTA & FISTA
- HDU 1856 More is better
- Java中this和super的区别
- python绑定C++类
- VC 对话框屏蔽ESC 和回车键 默认结束对话框
- 4、简单工厂模式
- 5、工厂方法
- Linux下没有 itoa
- tableView
- android ViewPager嵌套的使用方法