Pagini recente » Cod sursa (job #2831232) | Cod sursa (job #1925818) | Cod sursa (job #1722746) | Rating Groza Marius-Cristian (GrozaCristian) | Cod sursa (job #2558898)
#include <bits/stdc++.h>
using namespace std;
ifstream in("schi.in");
ofstream out("schi.out");
int n,a[30001];
int tree[30001];
int sol[30001];
int sumPart(int poz)
{
int sum=0;
while(poz)
{
sum+=tree[poz];
poz-=poz&-poz;
}
return sum;
}
int suma(int st,int dr)
{
return sumPart(dr)-sumPart(st-1);
}
void adauga(int poz,int val)
{
while(poz<=n)
{
tree[poz]+=val;
poz+=poz&-poz;
}
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>a[i];
for(int i=n;i>=1;i--)
{
int st=1,dr=a[i];
int add=suma(st,dr);
while( add )
{
st=dr+1;
dr+=add;
add=suma(st,dr);
}
sol[dr]=i;
adauga(dr,1);
}
for(int i=1;i<=n;i++)
out<<sol[i]<<'\n';
return 0;
}