p108 more is better

#include 

using namespace std;

#define N 10000001
int Tree[N];
int sum[N];//sum的值只在Tree[x]==-1的时候有用 

int root(int x)
{
	if(Tree[x]==-1)return x;
	else
	{
		int tmp = root(Tree[x]);
		Tree[x] = tmp;
		return tmp;
	}
}


 int main()
 {
 	int n;
 	while(scanf("%d",&n)!=EOF)
 	{
	 	for(int i=1;ians) ans = sum[i];	
		 }
		 printf("%d\n",ans);
	 } 
 	return 0;
  }