-
题目描述:
-
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<iostream> using namespace std; const int n = 10000001; int tree[n]; //保存每个节点的双亲位置,-1为根节点 int sum[n]; //保存以下标为根的集合数量 int findroot(int x) { if (tree[x] == -1) return x; else { int temp = findroot(tree[x]); //压缩路径 tree[x] = temp; return temp; } } int main() { int m; int a, b; while (cin >> m) { for (int i=1; i<=n; ++i) { tree[i] = -1; sum[i] = 1; } while (m--) { cin >> a >> b; a = findroot(a); b = findroot(b); if (a != b) { tree[a] = b; //在不同集合合并两集合 sum[b] += sum[a]; } }//while int max = 1; for (int i=1; i<=n; ++i) if (tree[i] == -1 && sum[i] > max) //统计有多少个集合 max = sum[i]; cout << max << endl; } return 0; }