Pagini recente » Cod sursa (job #3205957) | Cod sursa (job #178171) | Cod sursa (job #2260723) | Cod sursa (job #2870322) | Cod sursa (job #2836994)
#include<fstream>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
int n, aib[30001], v[30001], rez[30001];
void update(int pos, int val)
{
for(int i=pos; i<=n; i += (i&(-i)))
aib[i] += val;
}
int query(int pos)
{
int sum = 0;
for(int i=pos; i>0; i -= (i&(-i)))
sum += aib[i];
return sum;
}
int cb(int i)
{
int pos = 0;
int pas = 1<<17;
int rez = 2e9;
while(pas)
{
if(pos + pas <= n)
{
if(pos + pas <= n && pos+pas <= v[i] + query(pos + pas))
{
if(pos+pas == v[i] + query(pos + pas))
rez = min(pos + pas, rez);
else
pos += pas;
}
}
pas >>= 1;
}
return rez;
}
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
}
for(int i=n; i>0; i--)
{
/*int curent = query(v[i]);
int pos = v[i] + curent;
int next = query(pos);
while(curent < next)
{
curent = next;
pos = v[i] + curent;
next = query(pos);
}
rez[pos]=i;*/
int pos = cb(i);
rez[pos] = i;
update(pos, 1);
}
for(int i=1; i<=n; i++)
cout<<rez[i]<<'\n';
return 0;
}