Pagini recente » Cod sursa (job #2289239) | Cod sursa (job #2730867) | Cod sursa (job #2072735) | Cod sursa (job #820733) | Cod sursa (job #2147663)
#include <fstream>
#define MAXN 30005
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int ait[MAXN * 4], sol[MAXN], v[MAXN], N;
inline void Build(int poz, int st, int dr) {
if (st == dr) {
ait[poz] = 1;
return;
}
int mij = (st + dr) / 2;
Build(poz * 2, st, mij);
Build(poz * 2 + 1, mij + 1, dr);
ait[poz] = ait[poz * 2] + ait[poz * 2 + 1];
}
inline void Update(int poz, int st, int dr, int p, int val) {
if (st == dr) {
sol[st] = val;
ait[poz] = 0;
return;
}
int mij = (st + dr) / 2;
if (p <= ait[poz * 2])
Update(poz * 2, st, mij, p, val);
else
Update(poz * 2 + 1, mij + 1, dr, p - ait[poz * 2], val);
ait[poz] = ait[poz * 2] + ait[poz * 2 + 1];
}
void Read() {
fin >> N;
for (int i = 1; i <= N; i++) {
fin >> v[i];
}
Build(1, 1, N);
}
void Solve() {
for (int i = N; i; i--)
Update(1, 1, N, v[i], i);
for (int i = 1; i <= N; i++)
fout << sol[i] << "\n";
}
int main () {
Read();
Solve();
fin.close(); fout.close(); return 0;
}