nbut线段树专题M - Buy Tickets

Description

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 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.

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.

本题用链表会超时，但本人不会treap，所以想用线段树，但也没什么头绪，参考了大牛的做法

由于最后一个人的位置是固定的，所以整个过程可以反过来进行，对于树上的每个节点，我们都去计算他当前的空格数，这个决定了此时要放的人的递归方向，如果他要放的位置比左节点的空格少，那么可以往左节点靠，不然，往右节点靠

看图：

 

 

 

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define maxn 300010

int tree[maxn<<2];
struct shu
{
  int val,pos;
}cnt[maxn];

int final[maxn];
void build(int p,int l,int r)//建立一棵空的树
{
  tree[p]=(r-l+1);
  if(l==r)
    return ;
  int mid=(l+r)>>1;
  build(p<<1,l,mid);
  build(p<<1|1,mid+1,r);
}

void update(int p,int l,int r,int pos,int val)
{
  int mid=(l+r)>>1;
  tree[p]--;//插入一个数，那么空就少一个
  if (l==r)
  {
    final[l]=val;
    return ;
  }
  if(pos<=tree[p<<1])//比左节点的空格数来的少，所以左边可以放下
     update(p<<1,l,mid,pos,val);
  else
  {
    pos-=tree[p<<1];//左右都是从0开始计算的，所以要减去左边的空格数
    update(p<<1|1,mid+1,r,pos,val);
  }  
}    

int main()
{
  int n;
  while(~scanf("%d",&n))
  {
    build(1,1,n);
    for (int i = 1; i <= n; ++i)
      scanf("%d%d",&cnt[i].pos,&cnt[i].val);
    for(int i=n;i>=1;i--)
      update(1,1,n,cnt[i].pos+1,cnt[i].val);
    printf("%d",final[1] );
    for (int i = 2; i <=n; ++i)
      printf(" %d",final[i]);
    printf("\n");
  }
  return 0;
}