Pagini recente » Istoria paginii utilizator/bum_bum | Istoria paginii runda/sumanr/clasament | Rating Ginjoveanu Dragos (dragos2133) | Istoria paginii utilizator/liviuch | Cod sursa (job #2020124)
#include <bits/stdc++.h>
using namespace std;
#define lsb(a) ((a) & (-a))
ifstream f("schi.in");
ofstream g("schi.out");
int N, step, aib[30005], a[30005], sol[300005];
int main() {
f >> N;
for (int i = 1; i <= N; ++i) {
cin >> a[i];
for (int j = i; j <= N; j += lsb(i)) {
++aib[j];
}
}
for (step = 1; step <= N; step <<= 1);
for (int i = N; i; --i) {
int ps = 0, x = a[i];
for (int j = step; j; j >>= 1) {
if (ps + j <= N && aib[ps + j] < x) {
ps += j;
x -= aib[ps];
}
}
sol[ps + 1] = i;
for (int j = ps + 1; j <= N; j += lsb(j)) {
aib[j] -= 1;
}
}
for (int i = 1; i <= N; ++i) {
cout << sol[i] << '\n';
}
return 0;
}