Pagini recente » Cod sursa (job #366801) | Cod sursa (job #1667411) | Cod sursa (job #291402) | Cod sursa (job #1448220) | Cod sursa (job #3220301)
using namespace std;
#ifdef EZ
#include "./ez/ez.h"
const string FILE_NAME = "test";
#else
#include <bits/stdc++.h>
const string FILE_NAME = "schi";
#endif
#define mp make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
#define cin fin
#define cout fout
ifstream fin (FILE_NAME + ".in");
ofstream fout (FILE_NAME + ".out");
const int vMAX = 30e3;
int aib[vMAX + 1];
void add(int pos, int val)
{
for (; pos <= vMAX; pos += pos&-pos) aib[pos] += val;
}
int que(int dr)
{
int s = 0;
for (; dr; dr -= dr&-dr) s += aib[dr];
return s;
}
int find(int x)
{
int s = 0, ind = 0;
for (int b = 14; b >= 0; --b)
{
int newind = ind | 1<<b;
if (newind <= vMAX && newind - (s + aib[newind]) < x)
{
ind = newind;
s += aib[ind];
}
}
return ind+1;
}
int main()
{
int n; cin >> n;
vector<int> q(n+1);
for (int i = 1; i <= n; ++i) cin >> q[i];
vector<int> loc(n+1);
for (int i = n; i >= 1; --i)
{
int ind = find(q[i]);
add(ind, +1);
loc[ind] = i;
}
for (int i = 1; i <= n; ++i) cout << loc[i] << '\n';
}