Cod sursa(job #3370646)

Utilizator oliv_1Bostinescu Octavian oliv_1 Data 26 octombrie 2026 16:09:53
Problema Schi Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.33 kb
#include <bits/stdc++.h>

using namespace std;
int AINT[100005],rasp[100005],v[100005];
int n;
void build(int n)
{
    for(int i=n; i<2*n; i++)
        AINT[i]=1;
    for(int i=n-1; i>=1; i--)
        AINT[i]=AINT[i*2]+AINT[i*2+1];
}
void update(int poz)
{
    int nod=n+poz-1;
    while(nod>0)
    {
        AINT[nod]--;
        nod/=2;
    }
}
int query(int stq, int drq, int nodst, int noddr, int ind)
{
    if(nodst>=stq && noddr<=drq)
        return AINT[ind];
    int qs=0,qd=0;
    if((nodst+noddr)/2>=stq)
        qs=query(stq, drq, nodst, (nodst+noddr)/2, ind*2);
    if((nodst+noddr)/2+1<=drq)
        qd=query(stq, drq, (nodst+noddr)/2+1, noddr, ind*2+1);
    return qs+qd;

}
int cautbin(int acata)
{
    int ras=0;
    for(int pas=(1<<15); pas>0; pas/=2)
    {
        if(query(1, ras+pas,1, n, 1)<acata)
            ras=ras+pas;
    }
    return ras+1;
}
int main()
{
    ifstream cin("schi.in");
    ofstream cout("schi.out");
    int cn=1,ccn;
    cin>>n;
    while(cn<n)
        cn=cn*2;
    ccn=n;
    n=cn;
    cn=ccn;

    build(n);
    for(int i=1; i<=cn; i++)
        cin>>v[i];
    for(int i=cn; i>=1; i--)
    {
        int poz=cautbin(v[i]);
        update(poz);
        rasp[poz]=i;
    }
    for(int i=1; i<=cn; i++)
        cout<<rasp[i]<<'\n';
    return 0;
}