专题训练_树状数组

题目

Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…

The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by train to Mianyang, Sichuan Province for the winter camp selection of the national team of Olympiad in Informatics.

It was one o’clock a.m. and dark outside. Chill wind from the northwest did not scare off the people in the queue. The cold night gave the Little Cat a shiver. Why not find a problem to think about? That was none the less better than freezing to death!

People kept jumping the queue. Since it was too dark around, such moves would not be discovered even by the people adjacent to the queue-jumpers. “If every person in the queue is assigned an integral value and all the information about those who have jumped the queue and where they stand after queue-jumping is given, can I find out the final order of people in the queue?” Thought the Little Cat.

Input

There will be several test cases in the input. Each test case consists of N + 1 lines where N (1 ≤ N ≤ 200,000) is given in the first line of the test case. The next N lines contain the pairs of values Posi and Vali in the increasing order of i (1 ≤ i ≤ N). For each i, the ranges and meanings of Posi and Vali are as follows:

• Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind the Posi-th person in the queue. The booking office was considered the 0th person and the person at the front of the queue was considered the first person in the queue.
• Vali ∈ [0, 32767] — The i-th person was assigned the value Vali.

There no blank lines between test cases. Proceed to the end of input.

Output

For each test cases, output a single line of space-separated integers which are the values of people in the order they stand in the queue.

思路

pos[i]表示这个人现在要插入的位置，如果原来pos[i]有人，那么这个人就往pos[i]+1摞，如果pos[i]+1有人，那么原来pos[i]+1的人就往后走。因为最后一个人的位置是肯定确定的，所以我们从后往前去安排人。当安排pos[i]时如果pos[i]有人，那么他自己就往后面走，直到有位置可以放为止。反正通过线段树的动态查找，只要pos<=tree[d<<1]就放左的下一颗，不然就放在右边的。

代码段

#include <iostream>
#include <cstdio>
#include <algorithm>
#include<vector>
#include<cstring>
using namespace std;
int a[200005],b[200005],ans[200005];
int temp,t;
struct node
{
    int l,r,ksum;
}tree[200005*10];
void build(int n,int l,int r)
{
    tree[n].l=l;
    tree[n].r=r;
    tree[n].ksum=r-l+1;
    if(l==r) return;
    int m=(l+r)>>1;
    build(n<<1,l,m);
    build(n<<1|1,m+1,r);
}
void f(int k,int v,int n)
{
    int m=(tree[n].l+tree[n].r)>>1;
    if(tree[n].l==tree[n].r)
    {
        tree[n].ksum=0;
        ans[tree[n].l]=v;
        return;
    }
    if(tree[n<<1].ksum>=k)
        f(k,v,n<<1);
    else
        f(k-tree[n<<1].ksum,v,n<<1|1);
    tree[n].ksum=tree[n<<1].ksum+tree[n<<1|1].ksum;
}
int main()
{
    while(~scanf("%d",&t))
    {
        build(1,1,t);
        temp=0;
        for(int i=1;i<=t;i++)
            scanf("%d%d",&a[i],&b[i]);
        for(int i=t;i>0;i--)
            f(a[i]+1,b[i],1);
        for(int i=1;i<t;i++)
            cout<<ans[i]<<" ";
            cout<<ans[t]<<endl;
    }
}