HDU 5592ZYB's Premutation （线段树求第K大）

ZYB’s Premutation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1021 Accepted Submission(s): 522

Problem Description

ZYB has a premutation P,but he only remeber the reverse log of each prefix of the premutation,now he ask you to
restore the premutation.

Pair (i,j)is considered as a reverse log if Ai>Aj is matched.

Input

In the first line there is the number of testcases T.

For each teatcase:

In the first line there is one number N.

In the next line there are N numbers Ai,describe the number of the reverse logs of each prefix,

The input is correct.

1≤T≤5,1≤N≤50000

Output

For each testcase,print the ans.

Sample Input

1
3
0 1 2

Sample Output

3 1 2
题意：
给出你每插入一个数，逆序数的总数。问原序列？
题解：
解释样例：0 1 2
当第一个位置插入一个数时，逆序数的为0.
。。二。。。。。。。。。，。。。。。1.
。。三。。。。。。。。。，。。。。。2.
从后往前推，当第三个数插入后，个数由1变成2个， 说明前面有一个大于他的数，既他是序列中第二大的，就是2.
其他自己推。 建一棵线段树，优先判断右子树，每次查询后，更新即可。
代码：

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string.h>
#define bababaa printf("!!!!!!!\n")
#define ll long long
using namespace std;
int n,t;
const int N=50010;
int a[N];
int sum[N<<2];
int output[N];
void pushup(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void build(int l,int r,int rt)
{
    if(l==r)
    {
        sum[rt]=1;
        return ;
    }
    int mid=(r+l)>>1;
    build(l,mid,rt<<1);
    build(mid+1,r,rt<<1|1);
    pushup(rt);
}
int query(int l,int r,int k,int rt)
{
    if(l==r)
    {
        sum[rt]=0;
        return l;
    }
    int res;
    int mid=(r+l)>>1;
    if(sum[rt<<1|1]>=k)
        res=query(mid+1,r,k,rt<<1|1);
    else
        res=query(l,mid,k-sum[rt<<1|1],rt<<1);
    pushup(rt);
    return res;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
        }
        build(1,n,1);
        a[0]=0;
        for(int i=n; i>=1; i--)
        {
            int cnt=a[i]-a[i-1];
            output[i]=query(1,n,cnt+1,1);
        }
        for(int i=1; i<n; i++)
        {
            printf("%d ",output[i]);
        }
        printf("%d\n",output[n]);
    }
}