PAT Advanced 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.

解题思路

LCA的裸题。。也是第一个公共结点的延伸版，如果暴搜保存到那个结点的路径再返回两个路径第一个不同结点的前一个结点，则在后3个测试点超时。事实上，给我们的BST的前序遍历有个特点，根结点一定是最先被访问的，所以在前序遍历中找到第一个结点值位于要找的两个结点中间的结点就是答案。

Code

• AC代码

#include<bits/stdc++.h>
using namespace std;
unordered_map<int, int> vis;
vector<int> pre; 

int getLCA(int u, int v) {
	for(int j = 0; j<pre.size(); j++) {
		if((pre[j]>=u && pre[j]<=v) || (pre[j]>=v && pre[j]<=u)){
			return pre[j];
		}
	}
}
int main() {
	//freopen("in.txt", "r", stdin);
	int N, M, temp, u, v;
	cin >> N >> M;
	pre.resize(M);
	for(int i = 0; i<M; i++) {
		cin >> pre[i];
		vis[pre[i]] = 1;
	}
	for(int i = 0; i<N; i++) {
		cin >> u >>  v;
		if(!vis[u] && !vis[v]) {
			printf("ERROR: %d and %d are not found.", u, v);
		} else if(!vis[u]) {
			printf("ERROR: %d is not found.", u);
		} else if(!vis[v]) {
			printf("ERROR: %d is not found.", v);
		} else {
			int lca = getLCA(u, v);
			if(lca == u) {
				printf("%d is an ancestor of %d.", u, v);
			} else if(lca == v) {
				printf("%d is an ancestor of %d.", v, u);
			} else {
				printf("LCA of %d and %d is %d.", u, v, lca); 
			}
		}
		printf("\n");
	}
	return 0;
}