Pagini recente » Cod sursa (job #1307598) | Cod sursa (job #693864) | Cod sursa (job #332371) | Cod sursa (job #707583) | Cod sursa (job #1263145)
#include <fstream>
#include <iostream>
#define DIM 30001
using namespace std;
ifstream is("schi.in");
ofstream os("schi.out");
int n, a[DIM], aib[DIM], sol[DIM];
int Sum(int k);
int Bs(int k);
void Update(int poz, int v);
int main()
{
is >> n;
for( int i = 1; i <= n; ++i)
{
is >> a[i];
Update(i, 1);
}
int poz;
for(int i = n; i >= 1; --i)
{
poz = Bs(a[i]);
Update(poz, -1);
sol[poz] = i;
}
for(int i = 1; i <= n; ++i)
os << sol[i] << '\n';
is.close();
os.close();
return 0;
}
int Bs(int k)
{
int st = 1, dr = n, mij, sol = n;
while (st <= dr)
{
mij = (st + dr) >> 1;
if(Sum(mij) >= k)
{
sol = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
return sol;
}
int Sum(int k)
{
int suma = 0;
for(int i = k; i >= 1; i -= i & -i)
suma += aib[i];
return suma;
}
void Update(int poz, int v)
{
for(int i = poz; i <= n; i += i & -i)
aib[i] += v;
return;
}