Pagini recente » Cod sursa (job #2864154) | Cod sursa (job #549380) | Cod sursa (job #2943582) | Cod sursa (job #2639691) | Cod sursa (job #3290086)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int aib[30001];
int v[30001];
int w[30001];
int n;
void update(int pos,int val)
{
while(pos<=n)
{
aib[pos]+=val;
pos+=(pos&(-pos));
}
}
int get(int pos)
{
int ans=0;
while(pos>0)
{
ans+=aib[pos];
pos-=(pos&(-pos));
}
return ans;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
update(i,1);
}
for(int i=n;i>=1;i--)
{
int st=1,dr=n+1,ans;
while(st<dr)
{
int mid=(st+dr)/2;
int x=get(mid);
if(x>=v[i]) dr=mid;
else if(x<v[i])
{
st=mid+1;
ans=mid+1;
}
else
{
ans=mid;
break;
}
}
w[ans]=i;
update(ans,-1);
}
for(int i=1;i<=n;i++)
{
fout<<w[i]<<'\n';
}
return 0;
}