290. 最近公共祖先-软件14

#include <iostream>
#include <cstdio>
using namespace std;
#define MAX 120
int Tree[MAX];

int LCA(int u, int v, int N) {
	int uF[MAX];
	int vF[MAX];
	for (int i = 1; i <= N; ++i) uF[i] = vF[i] = -1;
	int uFn = 1, vFn = 1, f = Tree[u];
	uF[uFn++] = u;
	while (f != -1) { // 如果设为f != 1则在输入u,v中有一个为1时出错
		uF[uFn++] = f;
		f = Tree[f];
	}
	f = Tree[v];
	vF[vFn++] = v;
	while (f != -1) {
		vF[vFn++] = f;
		f = Tree[f];
	}
	for (int i = 1; i < uFn; ++i) {
		for (int j = 1; j < vFn; ++j) {
			if (uF[i] == vF[j]) return uF[i];
		}
	}
	return 1;
}
int main(int argc, char** argv) {
	int T, N, M, u, v;
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &N);
		for (int i = 1; i <= N; ++i) Tree[i] = -1;
		for (int i = 1; i <= N - 1; ++i) {
			scanf("%d%d", &u, &v);
			Tree[v] = u;
		}
		scanf("%d", &M);
		while (M--) {
			scanf("%d%d", &u, &v);
			printf("%d\n", LCA(u, v, N));
		}
	}	
	return 0;
}