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(\le 1,000)$, the number of pairs of nodes to be tested; and $N(\le 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..

题目大意

在一棵二叉树中，找出两个节点的最近公共祖先节点；

思路

可以画一个二叉树，观察最近祖先节点的特点，可以发现，要找的两个节点分别在最近祖先节点的左右子树，再根据二叉搜索树的特点，也就是说，如果要找的两个节点，一个小于等于根节点，一个大于等于根节点，那么这个根节点即为所求；

坑点
这个题有一个地方容易误解，key值不是1~N，而是int范围的任意值；

代码

#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main(){
    int m, n;
    vector<int> preorder;
    map<int, bool> exist;
    scanf("%d%d", &m, &n);
    preorder.resize(n);
    for(int i=0; i<n; i++){
        scanf("%d", &preorder[i]);
        exist[preorder[i]] = true;
    }
    int u, v;
    while(m--){
        scanf("%d%d", &u, &v);
        if(!exist[u] && !exist[v]){
            printf("ERROR: %d and %d are not found.\n", u, v);
        }
        else if(!exist[u]){
            printf("ERROR: %d is not found.\n", u);
        }
        else if(!exist[v]){
            printf("ERROR: %d is not found.\n", v);
        }
        else{
            int ans;
            for(int i=0; i<n; i++){
               if((preorder[i] >= u && preorder[i] <= v) || (preorder[i] >= v && preorder[i] <= u)){
                    ans = preorder[i];
                    break;
               }
            }
            if(ans == u){
                printf("%d is an ancestor of %d.\n", u, v);
            }
            else if(ans == v){
                printf("%d is an ancestor of %d.\n", v, u);
            }
            else{
                printf("LCA of %d and %d is %d.\n", u, v, ans);
            }
        }
    }
    return 0;
}