POJ 2828 treap单点插入，遍历输出。(二)
a.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