spoj 227

留着

#include <cstdio>
#include <cstring>
#include <cstdlib>

#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

const int MAXN = 200010;

int pos[MAXN];
int sum[MAXN << 2];// = MAXN*4
int ans[MAXN];
int N, id;

void build( int l, int r, int rt )
{
    sum[rt] = r - l + 1;
    if ( l == r ) return;

    int m = ( l + r ) >> 1;// = (l+r)/2
    build( lson );
    build( rson );
    return;
}

void Update( int po, int l, int r, int rt )
{
    --sum[rt];
    if ( l == r )
    {
        id = l;
        return;
    }

    int m = ( l + r ) >> 1;// = (l+r)/2

    if ( po <= sum[rt << 1] ) Update( po, lson ); // = rt*2
    else Update( po - sum[rt << 1], rson );  // = rt*2

    return;
}

int main()
{
    int T;
    scanf( "%d", &T );
    while ( T-- )
    {
        scanf( "%d", &N );
        build( 1, N, 1 );
        for ( int i = 1; i <= N; ++i )
            scanf( "%d", &pos[i] );

        for ( int i = N; i > 0; --i )
        {
            int addr = i - pos[i]; //还剩几个数
            Update( addr, 1, N, 1 );
            ans[i] = id;
            //printf( "%d\n", id );
        }
        printf( "%d", ans[1] );
        for ( int i = 2; i <= N; ++i )
            printf( " %d", ans[i] );
        puts("");
    }
    return 0;
}

转载于:https://www.cnblogs.com/avema/p/3774261.html