Pagini recente » Cod sursa (job #2784418) | Cod sursa (job #2672001) | Cod sursa (job #700134) | Cod sursa (job #2270419) | Cod sursa (job #1684886)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int n;
int aib[30005], cls[30005], a[30005];
void Update(int p, int x)
{
while(p <= n)
{
aib[p] += x;
p = p + (p & (-p));
}
}
int Suma(int p)
{
int s = 0;
while(p > 0)
{
s = s + aib[p];
p = p - (p & (-p));
}
return s;
}
int Cautbin(int s)
{
int st, dr, m, suma, sol;
st = 1;
dr = n;
sol = -1;
while(st <= dr)
{
m = (st + dr) / 2;
suma = Suma(m);
if(suma == s)
{
sol = m;
dr = m - 1;
}
else if(suma > s) dr = m - 1;
else st = m + 1;
}
return sol;
}
int main()
{
int i, p;
fin >> n;
for(i = 1; i <= n; i++)
Update(i, 1);
for(i = 1; i <= n; i++)
fin >> a[i];
for(i = n; i >= 1; i--)
{
p = Cautbin(a[i]);
cls[p] = i;
Update(p, -1);
}
for(i = 1; i <= n; i++)
fout << cls[i] << "\n";
fin.close();fout.close();
return 0;
}