Pagini recente » Solutii ONIS 2014, Runda 3 | Profil DavvDrg | Castori | Clasament FMI No Stress 6 | Cod sursa (job #2020146)
#include <iostream>
using namespace std;
#define plm(a) (a & -a)
ifstream f("schi.in");
ofstream g("schi.out");
int N, a[30005], aib[30005], sol[30005], plm1;
int main() {
f >> N;
for (int i = 1; i <= N; ++i) {
cin >> a[i];
for (int j = i; j <= N; j += plm(j))
++aib[j];
}
for (plm1 = 1; plm1 <= N; plm1 <<= 1);
for (int i = N; i > 0; --i) {
int pos = 0;
for (int j = plm1; j > 0; j >>= 1) {
if (pos + j <= N && aib[pos + j] < a[i]) {
pos += j;
a[i] -= aib[pos];
}
}
sol[pos + 1] = i;
for (int j = pos + 1; j <= N; j += plm(j)) {
--aib[j];
}
}
for (int i = 1; i <= N; ++i) {
g << sol[i] << "\n";
}
return 0;
}