poj 1330 LCA [ tarjan算法 deserve thinking ]

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");

using namespace std;
const int N = 10005;
bool vis[N];
int f[N], head[N], nex[N];
int p[N];
int ans, x, y;
int find(int x) {
	if(x == f[x]) return x;
	else {
		return f[x] = find(f[x]);
	}
}
void tarjan(int u) {
	f[u] = u;
	for(int k = head[u]; k+1; k = nex[k]) {
		tarjan(p[k]);
		f[p[k]] = u;
	}
	if(u == x && f[y])
		ans = find(y);
	else if(u == y && f[x]) {
		ans = find(x);
	}
}
int main() {
	int T, n;
	cin >> T;
	while(T--) {
		scanf("%d", &n);
		memset(head, 255, sizeof(head));
		memset(f, 0, sizeof(f));
		memset(p, 0, sizeof(p));
		memset(nex, 0, sizeof(nex));
		memset(vis, 0, sizeof(vis));
		int u;
		for(int i = 1; i < n; i++) {
			scanf("%d%d", &u, &p[i]);
			vis[p[i]] = true;
			nex[i] = head[u];
			head[u] = i;
		}
		scanf("%d%d", &x, &y);
		for(int i = 1; i <= n; i++) {
			if(!vis[i]) {
				tarjan(i);
				break;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}