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.

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 Pos_i and Val_i in the increasing order of i (1 ≤ i ≤ N). For each i, the ranges and meanings of Pos_i and Val_i are as follows:

• Pos_i ∈ [0, i − 1] — The i-th person came to the queue and stood right behind the Pos_i-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.
• Val_i ∈ [0, 32767] — The i-th person was assigned the value Val_i.

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

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.

*

poj2828 BuyTickets 线段树

给你n个pos[]和val[],表示val[i]在第pos[i]个数的右边

感觉好像做过类似的题目

对于第i个数而言,它的前面必然后pos[i]个数,所以考虑从后面往前处理

(如果顺序来的话没办法解决移位)

倒序的话我们则考虑在第i个数前面留下pos[i]个空位即可,所以利用线段树找出第

pos[i]+1个空位即可                             //不知为何G++会TLE

hhh-2016-03-24 15:51:59

*/

#include <algorithm>

#include <cmath>

#include <queue>

#include <iostream>

#include <cstring>

#include <map>

#include <cstdio>

#include <vector>

#include <functional>

#define lson (i<<1)

#define rson ((i<<1)|1)

using namespace std;

typedef long long ll;

const int maxn =  200020;

struct node

{

    int l,r;

    int num;

    int mid()

    {

        return ((l+r)>>1);

    };

} tree[maxn<<2];

void update_up(int i)

{

    tree[i].num = tree[lson].num + tree[rson].num;

}

void build(int i,int l,int r)

{

    tree[i].l = l,tree[i].r = r;

    if(l == r)

    {

        tree[i].num = 1;

        return ;

    }

    int mid = tree[i].mid();

    build(lson,l,mid);

    build(rson,mid+1,r);

    update_up(i);

}

void update_down(int i)

{

}

int cur;

void Insert(int i,int k)

{

    if(tree[i].l ==  tree[i].r)

    {

        tree[i].num = 0;

        cur = tree[i].l;

        return;

    }

    update_down(i);

    int mid = tree[i].mid();

    if(k <= tree[lson].num)

        Insert(lson,k);

    else

        Insert(rson,k-tree[lson].num);

    update_up(i);

}

int a[maxn],val[maxn],ans[maxn];

int main()

{

    int k,n,t,m,nex;

    while(scanf("%d",&n) != EOF)

    {

        for(int i = 1; i <= n; i++)

            scanf("%d%d",&a[i],&val[i]);

        build(1,1,n);

        for(int i = n ; i > 0; i--)

        {

            Insert(1,a[i]+1);

            //cout << cur <<endl;

            ans[cur] = val[i];

        }

        for(int i = 1; i <= n; i++)

        {

            printf("%d",ans[i]);

            printf("%c",i==n ? '\n':' ');

        }

    }

    return 0;

}