1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define all(x) x.begin(), x.end()
#define CLR(i, a) memset(i, a, sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int)a.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef array<ll, 3> arr;
typedef double DB;
typedef pair<DB, DB> pdd;
constexpr ll MAXN = static_cast<ll>(5e5) + 10, INF = static_cast<ll>(5e18) + 3;
ll N, M, T, P[MAXN], ans[MAXN];
struct BIT {
ll tr[MAXN];
int n;
inline int lowbit(int x) { return x & (-x); }
BIT(int ln) {
n = ln;
FOR(i, 1, n) { tr[i] = 0; }
}
inline void add(int p, int x) {
while (p <= n) {
tr[p] += x;
p += lowbit(p);
}
}
inline ll query(int l, int r) {
ll lres = 0, rres = 0;
l -= 1;
while (l > 0) {
lres += tr[l];
l -= lowbit(l);
}
while (r > 0) {
rres += tr[r];
r -= lowbit(r);
}
return rres - lres;
}
inline int findKth(int k) {
int cx = 0;
for (int i = 1 << 20; i > 0; i >>= 1) {
if (cx + i <= n && lowbit(cx + i) - tr[cx + i] < k) {
k -= lowbit(cx + i) - tr[cx + i];
cx += i;
}
}
return cx+1;
}
};
inline void solve() {
cin >> N;
BIT cnt(N);
FOR(i, 1, N) { cin >> P[i]; }
ROF(i, N, 1) {
ll p = cnt.findKth(P[i]);
ans[p] = i;
cnt.add(p, 1);
}
FOR(i, 1, N) { cout << ans[i] << ' '; }
cout << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
