1151 LCA in a Binary Tree

题目：

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 Yis 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.

题目大意：给出中序序列和先序序列，再给出两个点，求这两个点的最近公共祖先

思路：在不构建树的情况下，在每一层的递归中，可以得到树的根结点，在此时并入lca算法，若a和b在根结点的左边，则a和b的最近公共祖先在当前子树根结点的左子树寻找，如果a和b在当前子树根结点的两边，在当前子树的根结点就是a和b的最近公共祖先，如果a和b在当前子树根结点的右边，则a和b的最近公共祖先就在当前子树的右子树寻找，从而可以确定两个结点的公共祖先

代码：（满分）

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<map>
using namespace std;
int n,m;
int inorder[10005], preorder[10005];
map<int, int> flag;
void lca(int inL, int inR, int preL, int u, int v){
    if(inL > inR){
        return;
    }
    int inRoot = flag[preorder[preL]], inU = flag[u], inV = flag[v];
    if(inU < inRoot && inV < inRoot){
        lca(inL, inRoot - 1, preL + 1, u, v);
    }else if((inU < inRoot && inV > inRoot) || (inU > inRoot && inV < inRoot)){
        printf("LCA of %d and %d is %d.\n", u, v, inorder[inRoot]);
    }else if(inU > inRoot && inV > inRoot){
        lca(inRoot + 1, inR, preL + 1 + (inRoot - inL), u, v);
    }else if(inU == inRoot){
        printf("%d is an ancestor of %d.\n", u, v);
    }else if(inV == inRoot){
        printf("%d is an ancestor of %d.\n", v, u);
    }
}

int main(){
    scanf("%d%d", &m, &n);
    for(int i = 1; i <= n; i++){
        scanf("%d", &inorder[i]);
        flag[inorder[i]] = i;
    }
    for(int i = 1; i <= n; i ++){
        scanf("%d", &preorder[i]);
    }
    // Node * root = build(0, n - 1, 0, n - 1);
    for(int i = 0; i < m; i++){
        int u,v;
        scanf("%d%d", &u, &v);
        if(flag[u] == 0 && flag[v] == 0){
            printf("ERROR: %d and %d are not found.\n", u, v);
        }else if(flag[u] == 0 || flag[v] == 0){
            printf("ERROR: %d is not found.\n", flag[u] == 0 ? u : v);
        }
        else{
            lca(1, n, 1, u, v);
        }
    }
    return 0;
}