More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 34240 Accepted Submission(s): 12126 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.
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. |
#include<stdio.h>
int pre[10000111],rank[10000111];
int n,ret;
void init()
{
int i;
for(i=1;i<=10000000;i++)
{
pre[i]=i;
rank[i]=1;
}
ret=0;
}
int find(int root){
int son,tmp;
son=root;
while(root!=pre[root]){
root=pre[root];
}
while(son!=root){
tmp=pre[son];
pre[son]=root;
son=tmp;
}
return root;
}
void join(int root1,int root2){
int x,y;
x=find(root1);
y=find(root2);
if(x!=y){
if(rank[x]>rank[y]){
pre[y]=x;
rank[x]+=rank[y];
if(ret<rank[x])ret=rank[x];
}
else{
pre[x]=y;
rank[y]+=rank[x];
if(ret<rank[y])ret=rank[y];
}
}
}
int main()
{
int a,b;
while(~scanf("%d",&n)){
if(n==0){
printf("1\n");
continue;
}
init();
while(n--){
scanf("%d%d",&a,&b);
join(a,b);
}
printf("%d\n",ret);
}
}