[AcWing 244] 谜一样的牛

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 2e5 + 10;

int n;
int h[N];
int tr[N];
int ans[N];

int lowbit(int x)
{
    return x & -x;
}

void add(int x, int c)
{
    for (int i = x; i <= n; i += lowbit(i))
        tr[i] += c;
}

int ask(int x)
{
    int res = 0;
    for (int i = x; i; i -= lowbit(i))
        res += tr[i];
    return res;
}

void solve()
{
    cin >> n;
    for (int i = 2; i <= n; i ++)
        cin >> h[i];
    for (int i = 1; i <= n; i ++)
        add(i, 1);
    for (int i = n; i; i --) {
        int k = h[i] + 1;
        int l = 1, r = n;
        while (l < r) {
            int mid = l + r >> 1;
            if (ask(mid) >= k)
                r = mid;
            else
                l = mid + 1;
        }
        ans[i] = l;
        add(l, -1);
    }
    for (int i = 1; i <= n; i ++)
        cout << ans[i] << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    solve();

    return 0;
}