点击打开链接http://acm.hdu.edu.cn/showproblem.php?pid=1856
/* ***********************************************
Author :小蔡虎
Created Time :2014/7/
File Name :E:\2014ACM\HDU
状态 :
************************************************ */
#include<stdio.h>
#include<string.h>
#include<string>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<time.h>
#define PI 3.141592654
#define MA 10000005
using namespace std;
/*
*/
int father[MA],son[MA];
void Father()
{
for(int i=1;i<MA;i++){
father[i]=i;
son[i]=1;
}
}
int Find(int x)
{
if(x!=father[x])
father[x]=Find(father[x]);
return father[x];
}
void Union(int a,int b)
{
int x=Find(a);
int y=Find(b);
father[y]=x;
if(x==y)
return;
son[x]+=son[y];
son[y]=0;
}
int main()
{
int n,i,a,b;
while(scanf("%d",&n)!=EOF)
{
Father();
for(i=1;i<=n;i++)
{
scanf("%d%d",&a,&b);
Union(a,b);
}
// for(i=1;i<100;i++)
// printf("%d ",son[i]);
int k=1;
for(i=1;i<MA;i++)
if(son[i]>k)
k=son[i];
printf("%d\n",k);
}
return 0;
}