POJ 2828 treap单点插入，遍历输出。

Buy Tickets

Time Limit: 4000MS Memory Limit: 65536KTotal Submissions: 11661 Accepted: 5726

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

• Pos_i ∈ [0, i − 1] — The i-th person came to the queue and stood right behind thePos_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 valueVal_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

40 771 511 332 6940 205231 192431 38900 31492

Sample Output

77 33 69 5131492 20523 3890 19243

题意：买火车票排队，有好多插队的，输出最后序列。

treap单点插入，然后中序遍历输出。

代码：

/* ***********************************************Author :rabbitCreated Time :2014/3/22 18:05:55File Name :1.cpp************************************************ */#pragma comment(linker, "/STACK:102400000,102400000")#include <stdio.h>#include <iostream>#include <algorithm>#include <sstream>#include <stdlib.h>#include <string.h>#include <limits.h>#include <string>#include <time.h>#include <math.h>#include <queue>#include <stack>#include <set>#include <map>using namespace std;#define INF 0x3f3f3f3f#define eps 1e-8#define pi acos(-1.0)typedef long long ll;int ran(){static int ranx=3222332;return ranx+=ranx<<2|1;}struct Node{Node *ch[2];int size,fix,val;}*root,*nill,mem[1000000];int tot;void newnode(Node* &o,int val){o=&mem[tot++];o->ch[0]=o->ch[1]=nill;o->size=1;o->val=val;o->fix=ran();}void up(Node *o){o->size=1+o->ch[0]->size+o->ch[1]->size;}void down(Node *o){}void cut(Node *o,Node *&a,Node *&b,int p){if(o->size<=p)a=o,b=nill;else if(p==0)a=nill,b=o;else {down(o);if(o->ch[0]->size>=p){b=o;cut(o->ch[0],a,b->ch[0],p);up(b);}else{a=o;cut(o->ch[1],a->ch[1],b,p-o->ch[0]->size-1);up(a);}}}void merge(Node *&o,Node *a,Node *b){if(a==nill)o=b;else if(b==nill)o=a;else {if(a->fix>b->fix){down(a);o=a;merge(o->ch[1],a->ch[1],b);}else {down(b);o=b;merge(o->ch[0],a,b->ch[0]);}up(o);}}void del(int p){Node *a,*b,*c;cut(root,a,b,p-1);cut(b,b,c,1);merge(root,a,c);}int ss[200000],cnt;void traval(Node *x){if(x==nill)return;if(x->ch[0]!=nill)traval(x->ch[0]);ss[cnt++]=x->val;if(x->ch[1]!=nill)traval(x->ch[1]);}int main(){     //freopen("data.in","r",stdin);     //freopen("data.out","w",stdout);     int n; while(~scanf("%d",&n)){ tot=0;newnode(nill,-INF);nill->size=0;root=nill; while(n--){ int i,j; scanf("%d%d",&i,&j); Node *a,*b,*c; newnode(a,j); cut(root,b,c,i); merge(root,b,a); merge(root,root,c); } cnt=0; traval(root); for(int i=0;i<cnt;i++)printf("%d%c",ss[i],i==cnt-1?'\n':' '); }     return 0;}