Pagini recente » Cod sursa (job #1577604) | Cod sursa (job #2765138) | Cod sursa (job #1831824) | Cod sursa (job #711220) | Cod sursa (job #1695374)
#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int aib[30005],v[30005],a[30005],i,j,n,aux;
inline int lbit(int x)
{
return((x^(x-1))&x);
}
void update(int x)
{
for(j=x;j<=n;j+=lbit(j))
aib[j]++;
return;
}
int compute(int x)
{
int sum=0;
for(j=x;j>0;j-=lbit(j))
sum+=aib[j];
return sum;
}
int main()
{
ifstream f("schi.in");
ofstream g("schi.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=n;i>=1;i--)
{
aux=compute(v[i]);
update(v[i]);
aux+=v[i];
while(a[aux]!=0) aux++;
a[aux]=i;
}
for(i=1;i<=n;i++) g<<a[i]<<'\n';
return 0;
}