5070. 前序遍历 已知后序和中序遍历 求前序遍历

#include <iostream>
#include <unordered_map>

using namespace std;

const int N = 50010;

int n, ans, a[N], b[N];
unordered_map<int, int> p;

void build(int al, int ar, int bl, int br)
{
    if (al > ar) return;

    int root = a[ar];
    int k = p[root];
    ans = root;

    build(al, k - 1 - bl + al, bl, k - 1);
    build(k - bl + al, ar - 1, k + 1, br);
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++) cin >> a[i];
    for (int i = 0; i < n; i ++)
    {
        cin >> b[i];
        p[b[i]] = i;
    }

    build(0, n - 1, 0, n - 1);

    cout << ans;

    return 0;
}