Pagini recente » Cod sursa (job #636488) | Cod sursa (job #641783) | Cod sursa (job #2558397) | Cod sursa (job #644149) | Cod sursa (job #3289605)
#include <fstream>
using namespace std;
const int NMAX = 30001; ///0
ifstream fin("schi.in");
ofstream fout("schi.out");
int n, aib[NMAX], v[NMAX], sol[NMAX];
void add(int poz, int val)
{
while(poz <= n)
{
aib[poz] += val;
poz += poz & (-poz);
}
}
int sum(int poz)
{
int s = 0;
while(poz)
{
s += aib[poz];
poz &= (poz - 1);
}
return s;
}
int cb(int x)
{
int st = 1, dr = n, mij;
while(st <= dr)
{
mij = (st + dr) / 2;
if(sum(mij) < x)st = mij + 1;
else dr = mij - 1;
}
return st;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; ++i) fin >> v[i], add(i, 1);
for(int i = n; i; --i)
{
int poz = cb(v[i]);
sol[poz] = i;
add(poz, -1);
}
for(int i = 1; i <= n; ++i) fout << sol[i] << '\n';
return 0;
}