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.
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
#include <cstdio>
const int MAX = 10000001;
int nMax;
struct Union_Find
{
int root;
int num;
}Father[MAX];
void Union(int x, int y);
int main(int argc, const char* argv[])
{
int nFriends = 0;
while (scanf("%d", &nFriends) == 1)
{
nMax = 1;
for (int i=1; i<MAX; ++i)
{
Father[i].root = i;
Father[i].num = 1;
}
int nFriendA = 0, nFriendB = 0;
for (int i=1; i<=nFriends; ++i)
{
scanf("%d%d", &nFriendA, &nFriendB);
Union(nFriendA, nFriendB);
}
printf("%d\n", nMax);
}
return 0;
}
int Find(int x)
{
if (x == Father[x].root)
{
return x;
}
else
{
return Father[x].root = Find(Father[x].root);
}
}
void Union(int x, int y)
{
int root_x = Find(x);
int root_y = Find(y);
if (root_x != root_y)
{
Father[root_y].num += Father[root_x].num;
Father[root_x].root = root_y;
if (Father[root_y].num > nMax)
{
nMax = Father[root_y].num;
}
}
}