倍增版的， 感受树状数组优美的性质。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#include<set>
#include<cmath>
#include<cstdlib>
#include<ctime>

using namespace std;

const int mx = 1e5 + 5;
const int inf = 1<<30;

void fre() {
    freopen(".txt", "r", stdin);
    freopen(".txt", "w", stdout);
}

int n;
int c[mx], b[mx], a[mx];
int h[mx];

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

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

inline int ask(int x) {
    int res = 0;
    for( ; x > 0; x -= lowbit(x)) res += c[x];
    return res;
}

inline int query(int x) {
    int ans = 0, sum = 0;
    for(int i = 20; i >= 0; i--) {
        if(ans + (1<<i) <= n && sum + c[ans+(1<<i)] < x) {
            sum += c[ans+(1<<i)];
            ans += (1<<i);
        }
    }
    return ans + 1;
}

int main(){
    //fre();
    cin >> n;
    add(1, 1);
    for(int i = 2; i <= n; i++) scanf("%d", &a[i]), add(i, 1);

    for(int i = n; i >= 1; i--) {
        h[i] = query(a[i]+1);
        add(h[i], -1);
    }

    for(int i = 1; i <= n; i++) printf("%d\n", h[i]);

    return 0;
}