More is better
Time Limit: 1000 ms / Memory Limit: 102400 kb
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.
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
4
1 2
3 4
5 6
1 6
4
1 2
3 4
5 6
7 8
Sample Output
4
2
Hint
A 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.
Source
HDU 2007 Programming Contest - Final
求连通在一起的节点数量的最大值。
用并查集分类。
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
#define MAX_N 10000001
#define INF 0x3f3f3f3f
int par[MAX_N];//fathers
int rak[MAX_N];//height of trees
int root[MAX_N], l;
int cnt[MAX_N];
//initialize n elements
void init(int n)
{
for(int i = 1; i <= n; i++){
par[i] = i;
rak[i] = 0;
}
}
//root search
int findroot(int x)
{
if( par[x] == x ){
return x;
}else {//се╩╞
return par[x] = findroot(par[x]);
}
}
//make sets together
void unite(int x, int y){
x = findroot(x);
y = findroot(y);
if(x == y)
return;
if(rak[x] < rak[y]){
par[x] = y;
}else{
par[y] = x;
if(rak[x] == rak[y])
rak[x]++;
}
}
int main()
{
int n, a, b, ans, maxn;
while(scanf("%d", &n) != EOF){
init(MAX_N);
ans = maxn = 1;
l = 0;
for(int i = 1; i <= n; i++){
scanf("%d%d", &a, &b);
unite(a, b);
maxn = max(maxn, max(a, b));
}
for(int i = 1; i <= maxn; i++){
if(findroot(i) == i){ ///预处理出所有根节点
root[l++] = i;
}
}
for(int i = 0; i < l; i++){
cnt[root[i]] = 0;
}
for(int i = 1; i <= maxn; i++){
cnt[findroot(i)]++;
//cout << i << ' ' << findroot(i) << endl;
}
for(int i = 0; i < l; i++){
ans = max(ans, cnt[root[i]]);
}
printf("%d\n", ans);
}
return 0;
}