poj 3481 sbt 版本

#include<cstdio>
#include<iostream>
using namespace std;
const int inf=~0U>>1;
struct ps
{
    int id,val;
    ps(int _i=0,int _val=0){id=_i;val=_val;}
    friend bool operator <(ps q,ps p)
    {
        return q.val<p.val;
    }
     friend bool operator ==(ps q,ps p)
     {
         return q.val==p.val&&q.id==p.id;
     }
    friend bool operator >(ps q,ps p)
         {
             return p<q;
         }
           friend bool operator !=(ps q,ps p)
     {
         return q.val!=p.val||q.id!=p.id;
     }
};
template<class T>
class sbt
{struct node
{
    T val;int size;
    node * c[2];
    node(T _d,int _s,node *_c){val=_d,size=_s,c[0]=c[1]=_c;}
    void rz(){size=c[0]->size+c[1]->size+1;}
};
node *root,*null;
void ro(node *&x,bool d)   //d==0 right_rotate
{
    node *p=x->c[d];
    x->c[d]=p->c[!d];
    p->c[!d]=x;
   x->rz(); p->rz();  x=p;
}
void maintain(node *&x,bool d)
{
     if(x==null) return;
     node *&p=x->c[d];
     if(p->c[d]->size>x->c[!d]->size) ro(x,d);
     else if(p->c[!d]->size>x->c[!d]->size)  {ro(p,!d);ro(x,d);}
     else return;
     maintain(x->c[0],0);
     maintain(x->c[1],1);
     maintain(x,0);
     maintain(x,1);
}
void insert(node *&x,T v)
{
    if(x==null) {x=new node(v,1,null); return;}
  //if(x->val==v) return;
  bool d=v>x->val;
  insert(x->c[d],v);
  maintain(x,d);
  x->rz();
}
void dele(node *&x,T v)
{
    if(x==null) return ;
    int d;
    if(x->val==v)
    {   node *ps=x;
        if(x->c[1]==null) {x=x->c[0];delete ps;return;}
        else if(x->c[0]==null) {x=x->c[1];delete ps;return ;}
        node *p=x->c[1];while(p->c[0]!=null) p=p->c[0];
        x->val=p->val;
        dele(x->c[1],p->val);d=1;
    }
    else
    {
        d=v>x->val;
        dele(x->c[d],v);
    }
    maintain(x,!d);
    x->rz();
}
T  select(node *x,int k)
{
    int r=x->c[0]->size;
    if(k==r)  return x->val;
    else if(k<r) return select(x->c[0],k);
    else  return select(x->c[1],k-r-1);
}
int ran(node *x,T v)
{
    if(x==null) return 0;
    int r=x->c[0]->size;
    if(v==x->val) return  r;
    else if(v<x->val) return ran(x->c[0],v);
    else  return r+1+ran(x->c[1],v);
}
T del_m(node *&x,bool d)
{
    node *y=x;
    while(y->c[d]!=null) y=y->c[d];
    T res=y->val; dele(root,res);
    return res;
}
node * pre(node *x,T v)
{
    if(x==null) return x;
    if(v<=x->val) return pre(x->c[0],v);
    else
    {
        node *p=pre(x->c[1],v);
        return p==null?x:p;
    }
}
node *suc(node *x,T v)
{
    if(x==null) return x;
    if(v>=x->val) return suc(x->c[1],v);
    else
    {
        node *p=suc(x->c[0],v);
        return p==null?x:p;
    }
}
void pr(node *x){if(x!=null) {pr(x->c[0]);cout<<x->val.id<<" ";pr(x->c[1]);}}
public:
   sbt(){null=new node(0,0,0);null->c[0]=null->c[1]=null;root=null;}
   void ins(T v){insert(root,v);}
   void del(T v){dele(root,v);}
   T find_k(int k){if(root->size<k) return ps(0,0);return select(root,k-1);}
   int rank(T d){return ran(root,d);}
   int Size(){return root->size;}
   T del_max(){return del_m(root,1);}
   T del_min(){return del_m(root,0);}
   T pre(T v){node *p=pre(root,v);if(p==null) return v;return p->val;}
   T suc(T v) {node *p=suc(root,v);if(p==null) return v;return p->val; }
   void pr(){pr(root);puts("");}
   T f_m(node *x,bool d)
   {
       while(x->c[d]!=null) x=x->c[d];
       if(x==null) return ps(0,0);
       else return x->val;
   }
};
int main()
{
    sbt<ps> T;
    int opt;
    while(scanf("%d",&opt)==1&&opt)
    {
        if(opt==2) printf("%d\n",T.del_max().id);
        else if(opt==3)  printf("%d\n",T.del_min().id);
        else {int k,p;scanf("%d%d",&k,&p);T.ins(ps(k,p));}
      //  T.pr();
    }
    return 0;
}