Jobdu 题目1444:More is better
2014-08-19 03:38
225 查看
http://ac.jobdu.com/problem.php?pid=1444
题目描述:
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.
输入:
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)
输出:
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
样例输入:
样例输出:
题目描述:
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.
输入:
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)
输出:
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
样例输入:
4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8
样例输出:
4 2
#include <cstdio> #define N 10000001 int Tree , num ; int findRoot(int x){ if (Tree[x] == -1) return x; else{ int tmp = findRoot(Tree[x]); Tree[x] = tmp; return tmp; } } int main(){ int n; while (scanf("%d", &n) != EOF){ for (int i = 0; i < N; i++){ Tree[i] = -1; num[i] = 1; } int a, b; while (n--){ scanf("%d%d", &a, &b); a = findRoot(a); b = findRoot(b); if (a != b){ Tree[b] = a; num[a] += num[b]; } } int ans = 1; for (int i = 0; i < N; i++){ if (num[i] > ans) ans = num[i]; } printf("%d\n", ans); } return 0; }
相关文章推荐
- 题目1444:More is better
- 【九度】题目1444:More is better
- 九度 题目1444:More is better
- 【九度OJ】题目1444:More is better 解题报告
- 九度 题目1444:More is better
- 题目1444:More is better
- 九度考研机试教程 67-题目1444:More is better
- 题目1444:More is better
- 题目1444:More is better
- 九度 题目1444:More is better
- 题目1444:More is better
- 题目67:More is better
- 九度OJ-1444:More is better(用并查集求集合大小)
- 九度 OJ 1444:More is better
- 九度OJ1444:More is better
- HDJ 1856 More is better
- HDU-1856-More is better (并查集)
- More is better HDU - 1856
- hd1856 More is better
- HDU 1856 More is better