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.
Given any two nodes in a binary tree, 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 binary tree, respectively. In each of the following two lines, N distinct integers are given as the inorder and preorder traversal sequences of the binary tree, respectively. It is guaranteed that the binary tree can be uniquely determined by the input sequences. 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 binary tree, 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
7 2 3 4 6 5 1 8
5 3 7 2 6 4 8 1
2 6
8 1
7 9
12 -3
0 8
99 99
结尾无空行
Sample Output:
LCA of 2 and 6 is 3.
8 is an ancestor of 1.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.
结尾无空行
Code(超时)
/**
根据中序和先序序列构建普通二叉树,并给她们编号,中序的顺序编号
**/
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int, bool> book;
map<int , int> pos;
vector<int> in, pre;
void lca(int h1, int t1, int h2, int t2, int u, int v){
if(h1 > t1)
return;
int root = h2;
while(in[root] != pre[h1]) root++;//这里会超时
if(pos[u] < pos[pre[h1]] && pos[v] < pos[pre[h1]])
lca(h1 + 1, h1 + root - h2, h2, root - 1, u, v);
else if(pos[u] > pos[pre[h1]] && pos[v] > pos[pre[h1]])
lca(h1 + root - h2 + 1, t1, root + 1, t2, u, v);
else if(pos[u] == pos[pre[h1]] || pos[v] == pos[pre[h1]])
printf("%d is an ancestor of %d.\n", pos[u] == pos[pre[h1]] ? u : v, pos[u] == pos[pre[h1]] ? v : u);
else
printf("LCA of %d and %d is %d.\n", u, v, pre[h1]);
}
int main(){
int n, m;//n pair, m nodes;
scanf("%d %d", &n, &m);
in.resize(m + 1);
pre.resize(m + 1);
for(int i = 1; i <= m; i++){
scanf("%d", &in[i]);
pos[in[i]] = i;
}
for(int i = 1; i <= m; i++)
scanf("%d", &pre[i]);
while(n--){
int u, v;
scanf("%d %d", &u, &v);
if(!pos[u] && !pos[v]){
printf("ERROR: %d and %d are not found.\n", u, v);
continue;
}
if(!pos[u] || !pos[v]){
printf("ERROR: %d is not found.\n", pos[u] == 0 ? u : v);
continue;
}
lca(1, m, 1, m, u, v);
}
}
上面这种利用中序和前序四个位置的方式while判断中序的的右端点位置或者左端点位置会超时,还用多次索引的数组元素也要用变量存,不然容易超时,这里通过记录前序的位置,从而得到中序的左右端点的位置
inRoot = pos[pre[前序的当前位置就是根]]。inRoot - 1就是左子树的右端点,inRoot + 1就是中序的右子树的左端点
然后再根据前序和中序长度一样推断出右子树的前序根位置
ACcode
/**
根据中序和先序序列构建普通二叉树,并给她们编号,中序的顺序编号
**/
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int, bool> book;
map<int , int> pos;
vector<int> in, pre;
void lca(int h1, int h2, int t2, int u, int v){// 1->pre 2->in
if(h2 > t2)
return;
int inRoot = pos[pre[h1]], inl = h2, inr = t2, aIn = pos[u], bIn = pos[v];//如果不用变量存储会超时
if(aIn < inRoot && bIn < inRoot)
lca(h1 + 1, inl, inRoot - 1, u, v);
else if(aIn > inRoot && bIn > inRoot)
lca(h1 + 1 + inRoot - inl, inRoot + 1, inr, u, v);
else if(aIn == inRoot)
printf("%d is an ancestor of %d.\n", u, v);
else if(bIn == inRoot)
printf("%d is an ancestor of %d.\n",v, u );
else
printf("LCA of %d and %d is %d.\n", u, v, pre[h1]);
}
int main(){
int n, m;//n pair, m nodes;
scanf("%d %d", &n, &m);
in.resize(m + 1);
pre.resize(m + 1);
for(int i = 1; i <= m; i++){
scanf("%d", &in[i]);
pos[in[i]] = i;
}
for(int i = 1; i <= m; i++)
scanf("%d", &pre[i]);
while(n--){
int u, v;
scanf("%d %d", &u, &v);
if(!pos[u] && !pos[v]){
printf("ERROR: %d and %d are not found.\n", u, v);
continue;
}
if(!pos[u] || !pos[v]){
printf("ERROR: %d is not found.\n", pos[u] == 0 ? u : v);
continue;
}
lca(1, 1, m, u, v);
}
}
LIUCUO
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int, int> pos;
vector<int> in, pre;
void lca(int inl, int inr, int preRoot, int a, int b)
{
if (inl > inr) return;
int inRoot = pos[pre[preRoot]], aIn = pos[a], bIn = pos[b];
if (aIn < inRoot && bIn < inRoot)
lca(inl, inRoot-1, preRoot+1, a, b);
else if ((aIn < inRoot && bIn > inRoot) || (aIn > inRoot && bIn < inRoot))
printf("LCA of %d and %d is %d.\n", a, b, in[inRoot]);
else if (aIn > inRoot && bIn > inRoot)
lca(inRoot+1, inr, preRoot+1+(inRoot-inl), a, b);
else if (aIn == inRoot)
printf("%d is an ancestor of %d.\n", a, b);
else if (bIn == inRoot)
printf("%d is an ancestor of %d.\n", b, a);
}
int main()
{
int m, n, a, b;
scanf("%d %d", &m, &n);
in.resize(n + 1), pre.resize(n + 1);
for (int i = 1; i <= n; i++) {
scanf("%d", &in[i]);
pos[in[i]] = i;
}
for (int i = 1; i <= n; i++) scanf("%d", &pre[i]);
for (int i = 0; i < m; i++) {
scanf("%d %d", &a, &b);
if (pos[a] == 0 && pos[b] == 0)
printf("ERROR: %d and %d are not found.\n", a, b);
else if (pos[a] == 0 || pos[b] == 0)
printf("ERROR: %d is not found.\n", pos[a] == 0 ? a : b);
else
lca(1, n, 1, a, b);
}
return 0;
}