//hdu 5592 线段树(傻逼题)
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string.h>
#define maxn 50005
using namespace std;
struct Tree
{
int l,r,len;
}tree[maxn*6];
int a[maxn],b[maxn];
void build(int a,int l,int r)
{
if(l==r)
{
tree[a].l=l;
tree[a].r=r;
tree[a].len=1;
return;
}
tree[a].l=l;
tree[a].r=r;
build(a*2,l,(l+r)/2);
build(a*2+1,(l+r)/2+1,r);
tree[a].len=tree[a*2].len+tree[a*2+1].len;
}
int query(int a,int v)
{
int ans;
if(tree[a].l==tree[a].r)
{
tree[a].len=0;
return tree[a].r;
}
int mid=tree[a].len-tree[a*2].len;
if(mid<=v)
ans=query(a*2,v-mid);
else
ans=query(a*2+1,v);
tree[a].len=tree[a*2].len+tree[a*2+1].len;
return ans;
}
int main()
{
//freopen("d:\\in.txt","r",stdin);
int T;
scanf("%d",&T);
while(T)
{
int n;
scanf("%d",&n);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d",&a[1]);
b[1]=a[1]=0;
for(int i=2;i<=n;i++)
{
scanf("%d",&b[i]);
a[i]=b[i]-b[i-1];
}
build(1,1,n);
for(int i=n;i>=1;i--)
b[i]=query(1,a[i]);
for(int i=1;i<=n-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[n]);
T--;
}
return 0;
}
hdu 5592 线段树
最新推荐文章于 2018-07-20 17:19:00 发布