PAT甲级 1143

1143 Lowest Common Ancestor （30 分）

The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.

A binary search tree (BST) is recursively defined as a binary tree which has the following properties:

• The left subtree of a node contains only nodes with keys less than the node's key.
• The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
• Both the left and right subtrees must also be binary search trees.

Given any two nodes in a BST, you are supposed to find their LCA.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 1,000), the number of pairs of nodes to be tested; and N (≤ 10,000), the number of keys in the BST, respectively. In the second line, N distinct integers are given as the preorder traversal sequence of the BST. Then M lines follow, each contains a pair of integer keys U and V. All the keys are in the range of int.

Output Specification:

For each given pair of U and V, print in a line LCA of U and V is A. if the LCA is found and A is the key. But if A is one of U and V, print X is an ancestor of Y. where X is A and Y is the other node. If U or V is not found in the BST, print in a line ERROR: U is not found. or ERROR: V is not found. or ERROR: U and V are not found..

Sample Input:

6 8
6 3 1 2 5 4 8 7
2 5
8 7
1 9
12 -3
0 8
99 99

Sample Output:

LCA of 2 and 5 is 3.
8 is an ancestor of 7.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.

题意 ：给出二叉排序树的结点数目和前序遍历序列，再给出数对结点，找出他们的最近公共祖先，根据实际情况按照题目要求的格式进行输出。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 10001;
int a[maxn];
int n, m;
unordered_set<int> S;
unordered_set<int>::iterator it1, it2;
int work(int now) {
	int mid, l = now+1, r = n;
	while(l <= r) {
		mid = (l+r) / 2;
		if(a[mid] < a[now]) {
			l = mid+1;
		}
		else {
			r = mid-1;
		}
	}
	return l;
}
int main() {
	scanf("%d %d", &m, &n); S.clear();
	for(int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		S.insert(a[i]);
	}
	while(m--) {
		int u, v;
		scanf("%d %d", &u, &v);
		if(S.find(u) == S.end() && S.find(v) == S.end()) {
			printf("ERROR: %d and %d are not found.\n", u, v);
		}
		else if(S.find(u) == S.end()) {
			printf("ERROR: %d is not found.\n", u);
		}
		else if(S.find(v) == S.end()) {
			printf("ERROR: %d is not found.\n", v);
		}
		else {
			int now = 1, mins = min(u, v), maxx = max(u, v);
			while(true) {
				if(a[now] < mins) {
					now = work(now);
				}
				else if(a[now] > maxx) {
					++now;
				}
				else {
					break;
				}
			}
			if(a[now] == u) {
				printf("%d is an ancestor of %d.\n", u, v);
			}
			else if(a[now] == v) {
				printf("%d is an ancestor of %d.\n", v, u);
			}
			else {
				printf("LCA of %d and %d is %d.\n", u, v, a[now]);
			}
		}
	}
	return 0;
}