POJ1330(Nearest Common Ancestors)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int N = 10000;
vector<int> a[N];
int f[N], r[N];

void DFS(int u, int dep){
    r[u] = dep;
    for(vector<int>::iterator it = a[u].begin(); it != a[u].end(); ++it){
        DFS(*it, dep+1);
    }
}

int main()
{
    int casenum, x, y;
    int n;
    scanf("%d", &casenum);
    for(int num = 0; num < casenum; num++){
        scanf("%d", &n);
        for(int j = 0; j < n; j++){
            a[j].clear();
        }
        memset(f, -1, sizeof(f));
        for(int i = 0; i < n-1; i++){
            scanf("%d%d", &x, &y);
            a[x-1].push_back(y-1);
            f[y-1] = x-1;
        }
        int i;
        for( i = 0; f[i] >= 0; i++){
           ;
        }
        cout << i << endl;
        DFS(i, 0);
        scanf("%d%d", &x, &y);
        x--; y--;
        while(x != y){
            if(r[x] > r[y]){
                x = f[x];
            }
            else{
                y = f[y];
            }
        }
        printf("%d\n", x+1);
    }
    return 0;
}