poj 3481

---

裸的平衡树，于是就1A了，于是这就是我以后的平衡树模板了
不要问我为什么用宏定义和结构体写出一个奇怪[极像数组并且可以用数组代替]的表达方式，
这是我最后的倔强。。。。。。

UPD：平衡树模板已换！

---

#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<iostream>
#include<algorithm>

#define fa(x)  mp[x].fa
#define cnt(x) mp[x].cnt
#define c(x,y) mp[x].c[y]

const int MAXN = 1000000, L = 0 ,R = 1;

struct Treenode{int c[2],fa,cnt;}mp[MAXN] = {0}, emp = {0} ;//cnt:size
int root , val[MAXN] = {0} , tot = 0;

inline void update(const int &si)
{cnt(si) = cnt(c(si,L)) + cnt(c(si,R)) + 1;}

inline int  build(const int ll,const int rr)
{
    int mid = (ll + rr)>>1 , newd;
    if(ll == rr) {update(ll); return ll;}
    if(rr>mid)c(mid,R) = newd = build(mid+1,rr) , fa(newd) = mid;
    if(ll<mid)c(mid,L) = newd = build(ll,mid-1) , fa(newd) = mid;
    update(mid);  return mid;
}

inline void rotate(const int x,int &k)
{
    int y = fa(x) , z = fa(y);
    int i = (c(y,R) == x) ,j = i^1 , fi = (c(z,R) == y);

    if(y != k) c(z,fi) = x;else  k = x;

    fa(x) = z;fa(y) = x ;fa(c(x,j))= y;
    c(y,i) = c(x,j); c(x,j) = y ;
    update(y);update(x);
}
inline void splay(const int x,int &k)
{
    while(x != k)
    {
      int y = fa(x) , z =fa(y);   
      if(y != k)
      {
        if((fa(y)==c(z,R))^(fa(x)==c(y,R)))rotate(x, k);
        else   rotate(y, k);
      }
      rotate(x,k);
    }
}
inline int find(int x)
{
    int now = root;
    while(true)
    {
        int p = cnt(c(now,L)) + 1;
        if(p == x) break;
        else if(p > x)  now = c(now,L);
        else   { x -= p;now = c(now,R);}
    }
    return now;
}
inline void del(const int x)
{
    splay(x ,root);
    if(c(root,R))
    {
        int y = find(cnt(c(x,L)) + 1 +1);
        splay(y , c(x,R));root = y;fa(y) = 0;
        c(y,L) = c(x,L);fa(c(x,L)) = y;update(y);
        mp[x] = emp;
    }
    else
    {
        root = c(root,L);fa(root) = 0;
        mp[x] = emp;
    }
    tot --;
}
inline void insert(const int x)
{
    int now = root , tag;

    if(!tot){root = x; tot ++;return;}
    while(1)
    {
        if(val[x] < val[now])
         if(c(now,L))now = c(now,L);else{tag = L;break;}
        else
         if(c(now,R))now = c(now,R);else{tag = R;break;}
    }
    c(now,tag) = x;fa(x) = now;
    cnt(x) = 1,now = x;
    while(now != root){now = fa(now);update(now);}
    splay(x,root);
    tot ++;
}
int main()
{

#ifndef ONLINE_JUDGE    
    freopen("poj3481.in","r",stdin);
    freopen("poj3481.out","w",stdout);
#endif  
    root = 0;
    while(true)
    {
        int c , a , b;
        scanf("%d",&c);
        if(c == 0)  break;
        else if(c == 1)
        {scanf("%d%d",&a,&b); val[a] = b; insert(a);}
        else
        {   
           if(!tot) {printf("0\n");continue;}
           if(c == 2)
            {printf("%d\n",(a = find(tot))); del(a);}
            else if(c == 3)
            {printf("%d\n",(a = find(1))); del(a); }
            else return -1;
        }
    }
#ifndef ONLINE_JUDGE    
    fclose(stdin);
    fclose(stdout);
#endif  
    return 0;
}