1143 Lowest Common Ancestor (30 分)

第一次遇见的时候觉得眼前一亮的题目，用二叉搜索树的性质来找最近公共祖先，首先两个数不是互相的最近公共祖先，那么它们的最近公共祖先就是这两个数出现之前，大于最小值，小于最大值的值，然后就是其中一个是另外一个的祖先的情况，如果没有找到上述满足条件的数，那么先遍历找到的那个数就是祖先，

#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[N];

int main() {
    int m, n; cin >> m >> n;
    map<int, int> mp;
    for (int i = 0; i < n; i++) { cin >> a[i]; mp[a[i]] = 1; }
    while (m--) {
        int x, y; cin >> x >> y;
        if (mp.find(x) == mp.end() && mp.find(y) == mp.end()) printf("ERROR: %d and %d are not found.\n", x, y);
        else if (mp.find(x) == mp.end()) printf("ERROR: %d is not found.\n", x);
        else if (mp.find(y) == mp.end()) printf("ERROR: %d is not found.\n", y);
        else {
            for (int i = 0; i < n; i++) {
                if (a[i] < max(x, y) && a[i] > min(x, y)) { printf("LCA of %d and %d is %d.\n", x, y, a[i]); break; }
                else if (a[i] == x) { printf("%d is an ancestor of %d.\n", x, y); break; }
                else if (a[i] == y) { printf("%d is an ancestor of %d.\n", y, x); break; }
            }
        }
    }
    return 0;
}