Pagini recente » Borderou de evaluare (job #463780) | Borderou de evaluare (job #2715323) | Borderou de evaluare (job #982535) | Borderou de evaluare (job #489531) | Cod sursa (job #1392861)
#include <iostream>
#include <fstream>
using namespace std;
ifstream F("schi.in");
ofstream G("schi.out");
const int N = 30010;
int n,a[N*4],b[N],ans[N];
int add(int n,int l,int r,int v)
{
if ( l == r )
{
a[n] = 1;
return l;
}
int ans = -1 , m = (l + r) / 2;
int free = (m-l+1) - a[n*2];
if ( free >= v )
ans = add(n*2,l,m,v);
else
ans = add(n*2+1,m+1,r,v-free);
a[n] = a[2*n] + a[2*n+1];
return ans;
}
int main()
{
F>>n;
for (int i=1;i<=n;++i)
F>>b[i];
for (int i=n;i>=1;--i)
{
int p = add(1,1,n,b[i]);
ans[p] = i;
//for (int i=1;i<=n;++i) cerr<<ans[i]<<' '; cerr<<'\n';
}
for (int i=1;i<=n;++i)
G<<ans[i]<<'\n';
}