poj2828(线段树点的查询)

: 4000MS		Memory Limit: 65536K
Total Submissions: 8472		Accepted: 4070

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.

Sample Input

4
0 77
1 51
1 33
2 69
4
0 20523
1 19243
1 3890
0 31492

Sample Output

77 33 69 51
31492 20523 3890 19243

Hint

The figure below shows how the Little Cat found out the final order of people in the queue described in the first test case of the sample input.

Source

POJ Monthly--2006.05.28, Zhu, Zeyuan
//题意：在一个伸手不见五指的夜晚，Little Cat还在买票，现在有n个插队的操作：x,y表示第y个人插第x人的队，最后打印出最终的排队序列。
//思路：从最后一个人往前插，这样pos的意义就变成了，前面有多少个空位。线段树上每个节点中存储的是当前时刻，该区间有多少空位。所以我们定义的结构体应该是这样的：
//struct binTree
//{
//    int l,r,m;
//};
//l和r为线段的左右指针，m为当前区间内还有m个空位。
//每当插入一次，那么空位就减1.
#include
#include
#include
using namespace std;
int n;
#define maxn 200010
int pos[maxn],val[maxn],newpos[maxn];
struct node
{
      int l;
      int r;
      int m;//
}Tree[maxn*3];
void build(int v,int l,int r)
{
      Tree[v].l=l;
      Tree[v].r=r;
      Tree[v].m=r-l+1;
      if(l==r)
      {
              return;
      }
      int mid=(l+r)/2;
      build(v*2,l,mid);
      build(v*2+1,mid+1,r);
}
int query(int v,int pos,int value)
{
      Tree[v].m--;
      if(Tree[v].l==Tree[v].r)
      {
              return Tree[v].l;
      }
      else if(Tree[v*2].m>=pos)
      {
              return query(v*2,pos,value);
      }
      else
      {
              return query(v*2+1,pos-Tree[v*2].m,value);
      }
}
int main()
{
      while(scanf("%d",&n)!=EOF)
      {
              int i;
              build(1,1,n);
              for(i=1;i<=n;i++)
              {
                      scanf("%d%d",&pos[i],&val[i]);
              }
              for(i=n;i>=1;i--)
              {
                      newpos[query(1,pos[i]+1,val[i])]=i;
              }

              for(i=1;i<=n;i++)
              {
                      printf("%d ",val[newpos[i]]);
              }
              printf("\n");
      }
      return 0;
}