Pagini recente » Cod sursa (job #2588706) | Cod sursa (job #339177) | Cod sursa (job #319536) | Cod sursa (job #371987) | Cod sursa (job #3268917)
#include <fstream>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
int n,v[30005],a[30005],l[30005];
void add(int p,int val)
{
for(int i=p;i<=n;i+=(i&-i)) a[i]+=val;
}
int sum(int p)
{
int s=0;
for(int i=p;i>0;i-=(i&-i)) s+=a[i];
return s;
}
int cb(int val) {
int st=1,dr=n;
int p=dr;
while(st<=dr)
{
int m=(st+dr)/2;
if(val<=sum(m))
{
p=m;
dr=m-1;
}
else st=m+1;
}
return p;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
for(int i=n;i>0;i--)
{
int z=cb(v[i]);
l[z]=i;
add(z,-1);
}
for(int i=1;i<=n;i++) g<<l[i]<<'\n';
return 0;
}