hdoj 1856.More is better

More is better

#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=10000000+10;
int n,father[MAXN],fatherson[MAXN];
void init(){
	for(int i=1;i<MAXN;i++){
		father[i]=i;
		fatherson[i]=1;
	}
}
int getfather(int a){
	int r;
	r=a;
	while(r!=father[r]){
		r=father[r];
	}
	int i=a;
	while(i!=father[i]){
		i=father[i];
		father[i]=r;
	}
	return r;
	/*
		if(a!=father[a]){
		father[a]=getfather(father[a]);
	}
	return a;
	*/
}
void Union(int a,int b){
	int fx=getfather(a);
	int fy=getfather(b);
	if(fx!=fy){
		if(fatherson[fx]>fatherson[fy]){
			fatherson[fx]+=fatherson[fy];
			father[fy]=fx;
		}
		else{
			fatherson[fy]+=fatherson[fx];
			father[fx]=fy;
		}
	}
}

int main()
{
	while(scanf("%d",&n)==1){
		int max=0;
		init();
		for(int i=0;i<n;i++){
			int a,b;
			scanf("%d %d",&a,&b);
			Union(a,b);
			/*
			if(fatherson[a]>max){
				max=fatherson[a];
			}
			if(fatherson[b]>max){
				max=fatherson[b];
			}
			*/
		}
		for(int i=1;i<MAXN;i++){
			if(fatherson[i]>max){
				max=fatherson[i];
			}
		}
		printf("%d\n",max);
	}
	return 0;
}