1151 LCA in a Binary Tree (30 分)

这次的比上个稍微难了一点，没有了二叉搜索树的性质，就是一个二叉树，那么方法就是暴力递归找，当前根节点就是先序序列的第一个数，先看两个数里面有没有等于当前根节点的，有的话就输出，没有的话，如果两个节点的下标在根节点的左右两侧，用中序序列判断，那么当前根节点就是答案，否则判断向左向右递归解决，
不过这应该是最朴素的解法，但是甲级也不会考什么倍增，tarjan，树链剖分，

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 1e4 + 5;

int a, b;
int pre[N], in[N];
map<int, int> mp;

void solve(int prel, int prer, int inl, int inr) {
    if (a == pre[prel]) { printf("%d is an ancestor of %d.\n", a, b); return; }
    if (b == pre[prel]) { printf("%d is an ancestor of %d.\n", b, a); return; }
    int k = mp[pre[prel]];
    if ((mp[a] - k) * (mp[b] - k) < 0) { printf("LCA of %d and %d is %d.\n", a, b, pre[prel]); return; }
    else if (mp[a] < k) solve(prel + 1, prel + k - inl, inl, k - 1);
    else solve(prel + k - inl + 1, prer, k + 1, inr);
}

int main() {
    int m, n; cin >> m >> n;
    for (int i = 0; i < n; i++) { cin >> in[i]; mp[in[i]] = i; }
    for (int i = 0; i < n; i++) cin >> pre[i];
    while (m--) {
        cin >> a >> b;
        if (mp.find(a) == mp.end() && mp.find(b) == mp.end()) printf("ERROR: %d and %d are not found.\n", a, b);
        else if (mp.find(a) == mp.end()) printf("ERROR: %d is not found.\n", a);
        else if (mp.find(b) == mp.end()) printf("ERROR: %d is not found.\n", b);
        else solve(0, n - 1, 0, n - 1);
    }
    return 0;
}