【PAT甲级】1143 Lowest Common Ancestor（30 分）（LCA）

题目链接

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.

题意：给出一棵二叉搜索树的先序遍历，问结点u和v的共同最低祖先是哪个节点

首先了解下LCA 最近公共祖先，先了解暴力，之后再用其他（离线在线）算法试试

思路：最暴力的方法，遍历一下。　Ｏ(n*m)

代码：

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define mem(a,n) memset(a,n,sizeof(a))
#define lowbit(i) ((i)&(-i))
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const double eps = 1e-6;
const int N = 1e3+5;

int m,n;
map<int,bool>mp;
int main() {
    mp.clear();
    scanf("%d%d",&m,&n);
    vector<int>pre(n+1);
    for(int i=0; i<n; i++) {
        scanf("%d",&pre[i]);
        mp[pre[i]]=1;
    }
    for(int i=0; i<m; i++) {
        int u,v,now;
        scanf("%d%d",&u,&v);
        for(int j=0; j<n; j++) {
            now=pre[j];
            if(now>u&&now<v || now>v&&now<u || now==u || now==v) {
                break;
            }
        }
        if(!mp[u] && !mp[v]) {
            printf("ERROR: %d and %d are not found.\n",u,v);
        } else if(!mp[u] || !mp[v]) {
            printf("ERROR: %d is not found.\n",mp[u]?v:u);
        } else if(now==u || now==v) {
            printf("%d is an ancestor of %d.\n",now,now==u?v:u);
        } else {
            printf("LCA of %d and %d is %d.\n",u,v,now);
        }
    }
    return 0;
}