1143 Lowest Common Ancestor （30 point(s)）

题解

利用BST的性质即可。

#include<iostream>
#include<cstdio>
#include<vector>
#include<unordered_map>
using namespace std;
int w, u, v, n, m;
unordered_map<int, bool> have;
int main() {
	scanf("%d%d", &m, &n);
	vector<int> pre(n);
	for(int i = 0; i < n; ++i) {
		scanf("%d", &pre[i]);
		have[pre[i]] = true;
	}
	for(int i = 0; i < m; ++i) {
		scanf("%d%d", &u, &v);
		for(int j = 0; j < n; ++j) {
			w = pre[j];
			if((w == u) || (w == v) || (w < u && w > v) || (w > u && w < v)) break;
		}
		if(!have[u] && !have[v]) printf("ERROR: %d and %d are not found.\n", u, v);
		else if(!have[u] || !have[v]) printf("ERROR: %d is not found.\n", have[u] ? v : u);
		else if(u == w || v == w) printf("%d is an ancestor of %d.\n", w, w == v ? u : v);
		else printf("LCA of %d and %d is %d.\n", u, v, w);
	}
	return 0;
}