Pagini recente » Cod sursa (job #1379742) | Cod sursa (job #1903993) | Cod sursa (job #838901) | Cod sursa (job #2942681) | Cod sursa (job #2560720)
#include <fstream>
#define dim 30005
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int n,v[dim],i,poz;
short aib[dim],sol[dim];
inline int query(int poz){
int r=0;
for(;poz!=0;poz-=poz&(-poz))
r+=aib[poz];
return r;
}
inline void update(int poz){
for(;poz<=n;poz+=(-poz)&poz)
aib[poz]++;
}
inline int solve(int x){
int st=1,dr=n,mid;
while(st<=dr){
mid=(st+dr)/2;
if(mid-query(mid)>=x)
dr=mid-1;
else st=mid+1;
}
return st;
}
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=n;i>=1;i--){
poz=solve(v[i]);
sol[poz]=i;
update(poz);
}
for(i=1;i<=n;i++)
fout<<sol[i]<<"\n";
}