QUT个人赛--寻找最近公共祖先(图的遍历<POJ1330>)

Description

A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: 

 
In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an ancestor of node 16. As a matter of fact, nodes 8, 4, 10, and 16 are the ancestors of node 16. Remember that a node is an ancestor of itself. Nodes 8, 4, 6, and 7 are the ancestors of node 7. A node x is called a common ancestor of two different nodes y and z if node x is an ancestor of node y and an ancestor of node z. Thus, nodes 8 and 4 are the common ancestors of nodes 16 and 7. A node x is called the nearest common ancestor of nodes y and z if x is a common ancestor of y and z and nearest to y and z among their common ancestors. Hence, the nearest common ancestor of nodes 16 and 7 is node 4. Node 4 is nearer to nodes 16 and 7 than node 8 is. 

For other examples, the nearest common ancestor of nodes 2 and 3 is node 10, the nearest common ancestor of nodes 6 and 13 is node 8, and the nearest common ancestor of nodes 4 and 12 is node 4. In the last example, if y is an ancestor of z, then the nearest common ancestor of y and z is y. 

Write a program that finds the nearest common ancestor of two distinct nodes in a tree. 

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case starts with a line containing an integer N , the number of nodes in a tree, 2<=N<=10,000. The nodes are labeled with integers 1, 2,..., N. Each of the next N -1 lines contains a pair of integers that represent an edge --the first integer is the parent node of the second integer. Note that a tree with N nodes has exactly N - 1 edges. The last line of each test case contains two distinct integers whose nearest common ancestor is to be computed.

Output

Print exactly one line for each test case. The line should contain the integer that is the nearest common ancestor.

Sample Input

2
16
1 14
8 5
10 16
5 9
4 6
8 4
4 10
1 13
6 15
10 11
6 7
10 2
16 3
8 1
16 12
16 7
5
2 3
3 4
3 1
1 5
3 5

Sample Output

4
3

题目大意：

输入提个数T，表示测试的组数。输入一个数N，下面跟着N对数，其中最后一组数便是我们要用到的数据，寻找它俩的公共祖先。

解题思路：

先用father[100010]数组将图建立起来，并将visit[]数组全都赋为false，来判断是否走过；

通过遍历的方式寻找公共祖先即可。

代码实现：

•     scanf("%d",&T);  
•     while(T--)  
•     {  
•         memset(vis,false,sizeof(vis));  
•         memset(father,-1,sizeof(father)); 
  
  
•         scanf("%d",&n);  
•         for(int i=1;i<n;i++) //将前n-1行图建好
  
•         {  
•             scanf("%d%d",&x,&y);  
•             father[y]=x;   //表示y的父节点是x
•         }  
•         scanf("%d%d",&a,&b);  //输入最后两个数字
•         while(b!=-1)  //当b有父节点
•         {  
•             vis[b]=true;  //将vis[b]标记为true，表示已走过
•             b=father[b];   //将b的父节点赋给b
•         }  
•         while(!vis[a])   //关键点，找到b的祖先后，再找a的公共祖先。当vis[a]没有走过
•             a=father[a];   //将a的父节点赋给a，之后一直循环，知道找到公共祖先为止
•         printf("%d\n",a);  
•     }  
•     return 0;  
• }