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<stdio.h>
#include<unordered_set>
#include<algorithm>
using namespace std;
int m,n;
int pre[10005];
unordered_set<int> has;//判断有没有a,b
int main(){
scanf("%d %d",&m,&n);
for(int i=0;i<n;i++){
scanf("%d",pre+i);
has.insert(pre[i]);
}
for(int i=0;i<m;i++){
int a,b;
scanf("%d %d",&a,&b);
int j=0;
for(;j<n;j++){//在先序序列中找a,b可能的最近公共祖先
if((pre[j]>=a&&pre[j]<=b)||(pre[j]<=a&&pre[j]>=b))
break;
}
int lca=pre[j];
bool hasa=has.find(a)!=has.end()?true:false;
bool hasb=has.find(b)!=has.end()?true:false;
if(!hasa&&!hasb){
printf("ERROR: %d and %d are not found.\n",a,b);
}else if(!hasa){
printf("ERROR: %d is not found.\n",a);
}else if(!hasb){
printf("ERROR: %d is not found.\n",b);
}else {
if(lca==a)
printf("%d is an ancestor of %d.\n",a,b);
else if(lca==b)
printf("%d is an ancestor of %d.\n",b,a);
else
printf("LCA of %d and %d is %d.\n",a,b,lca);
}
}
return 0;
}