UVA 11525 Permutation 康拓展开

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<cmath>
#include<climits>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb(a) push_back(a)
#define INF 0x1f1f1f1f
#define lson idx<<1,l,mid
#define rson idx<<1|1,mid+1,r
#define PI  3.1415926535898
template<class T> T min(const T& a,const T& b,const T& c) {
    return min(min(a,b),min(a,c));
}
template<class T> T max(const T& a,const T& b,const T& c) {
    return max(max(a,b),max(a,c));
}
void debug() {
#ifdef ONLINE_JUDGE
#else

    freopen("d:\in.txt","r",stdin);
   // freopen("d:\out1.txt","w",stdout);
#endif
}
int getch() {
    int ch;
    while((ch=getchar())!=EOF) {
        if(ch!=' '&&ch!='
')return ch;
    }
    return EOF;
}
const int maxn=55555;
int sum[maxn<<2];
int build(int idx,int l,int r)
{
    sum[idx]=r-l+1;
    if(l==r)return 0;
    int mid=(r+l)>>1;
    build(lson);
    build(rson);
    return 0;
}
int query(int idx,int l,int r,int v,int &pos)
{
    if(l==r)
    {
        pos=l;
    }else
    {
        int mid=(r+l)>>1;
        if(sum[idx<<1]>=v)query(lson,v,pos);
        else query(rson,v-sum[idx<<1],pos);
    }
    sum[idx]--;
    return 0;
}

int ans[maxn];
int main()
{
    int t;
    scanf("%d",&t);
    for(int ca=1;ca<=t;ca++)
    {
        int k;
        scanf("%d",&k);
        build(1,1,k);
        for(int K=1;K<=k;K++)
        {
            int s,pos;
            scanf("%d",&s);
            query(1,1,k,s+1,pos);
            ans[K]=pos;
        }
        for(int i=1;i<=k;i++)
            printf("%d%c",ans[i],i==k?'
':' ');

    }
    return 0;
}