http://poj.org/problem?id=2828
| Time Limit: 4000MS | Memory Limit: 65536K | |
| Total Submissions: 10478 | Accepted: 5079 |
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 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.
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
【题解】：
线段树节点中保存这一段中的空位数，然后倒序对pos插入：
例如： 0 77
1 51
1 33
2 69
先取： 2 69 —— —— —69— —— （需要前面有3个空位才能插入）
然后取： 1 33 —— —33— —69— —— （需要前面有2个空位才能插入）
然后取： 1 51 —— —33— —69— —51— （需要前面有2个空位才能插入） 前面只有1个空位 故插入后面空格
然后取： 0 77 —77— —33— —69— —51— （需要前面有1个空位才能插入）
【code】：
1 #include<iostream> 2 #include<stdio.h> 3 #include<string.h> 4 #define N 200010 5 #define lson p<<1 6 #define rson p<<1|1 7 8 using namespace std; 9 10 struct Nod 11 { 12 int l,r; 13 int va; //空位数 14 }node[N<<2]; 15 16 int pos[N],val[N],ans[N]; 17 18 void building(int l,int r,int p) 19 { 20 node[p].l = l; 21 node[p].r = r; 22 node[p].va = r-l+1; 23 if(l==r) return; 24 int mid = (l+r)>>1; 25 building(l,mid,lson); 26 building(mid+1,r,rson); 27 } 28 29 int update(int ps,int p) 30 { 31 node[p].va--; //空位数减1 32 if(node[p].l==node[p].r) 33 { 34 return node[p].l; //返回插入位置 35 } 36 if(node[lson].va>=ps) update(ps,lson); //当左孩子的空格大于等于插入位置时往左边插入 37 else 38 { 39 ps-=node[lson].va; //当左边的空格小于ps，则插入右边，插入右边位置ps应该减左边的空格数 40 update(ps,rson); 41 } 42 } 43 44 int main() 45 { 46 int n; 47 while(~scanf("%d",&n)) 48 { 49 int i; 50 building(1,n,1); 51 for(i=1;i<=n;i++) scanf("%d%d",pos+i,val+i); 52 for(i=n;i>=1;i--) //倒过来更新，则可以确定最后的位置 53 { 54 int id = update(pos[i]+1,1); //得到插入地方 55 ans[id] = val[i]; //存入ans数组 56 } 57 for(i=1;i<n;i++) printf("%d ",ans[i]); 58 printf("%d ",ans[n]); 59 } 60 return 0; 61 }