1151 LCA in a Binary Tree

可以参考之前这题大神的解法 1143 Lowest Common Ancestor 柳婼 の blog， 不需要建树就可以做。

这题先做个预处理，根据中序遍历的顺序把节点从0开始编号，记录在map中，然后把先序遍历数组中的值替换为对应节点的编号，这样得到的先序遍历就是二叉查找树的的先序遍历了。在query部分，把输入的值转换为编号，接下去就跟1143做法一样了。

#include<iostream>
#include<unordered_map>
using namespace std;
int in[10005], pre[10005];
unordered_map<int, int>num2id, id2num;
int m, n;
int main(){
	scanf("%d%d", &m, &n);
	for (int i = 0; i < n; ++i) scanf("%d", &in[i]);
	for (int i = 0; i < n; ++i) scanf("%d", &pre[i]);
	for (int i = 0; i < n; ++i) {
		num2id[in[i]] = i;
		id2num[i] = in[i];
	}
	for (int i = 0; i < n; ++i) pre[i] = num2id[pre[i]];
	int u, v, nu, nv;
	bool fu, fv;
	for (int i = 0; i < m; ++i) {
		scanf("%d%d", &u, &v);
		fu = num2id.find(u) != num2id.end();
		fv = num2id.find(v) != num2id.end();
		if (!fv && !fu) printf("ERROR: %d and %d are not found.\n", u, v);
		else if (!fv) printf("ERROR: %d is not found.\n", v);
		else if (!fu) printf("ERROR: %d is not found.\n", u);
		else {
			nu = num2id[u];
			nv = num2id[v];
			int a;
			for (int k=0; k < n; ++k) {
				a = pre[k];
				if ((a >= nu && a <= nv) || (a <= nu && a >= nv)) break;
			}
			if (a == nu || a == nv) printf("%d is an ancestor of %d.\n", id2num[a], a == nu ? v : u);
			else printf("LCA of %d and %d is %d.\n", u, v, id2num[a]);
		}
	}
	return 0;
}