poj3481 splaytree模板题

找不到错在哪里，先留着吧

/*
splay是以键值排序的！
三个操作：1 a b,z增加键值为b的点，值为a
         2，查询最大值
         3，查询最小值
需要的操作：rotate，splay，insert，findx,delete
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 1000005
int pre[maxn],ch[maxn][],size[maxn],key[maxn],num[maxn],root,tot;

void newnode(int &r,int fa,int k,int val){
    r=++tot;
    pre[r]=fa;
    ch[r][]=ch[r][]=;
    key[r]=k;
    num[r]=val;
}
void pushup(int r){
    size[r]=;
    if(ch[r][]) size[r]+=size[ch[r][]];
    if(ch[r][]) size[r]+=size[ch[r][]];
    size[r]+=;
}
void rotate(int x,int kind){//0左旋，1右旋
    int fa=pre[x];
    ch[fa][!kind]=ch[x][kind];
    pre[ch[x][kind]]=fa;
    if(pre[fa])
        ch[pre[fa]][ch[pre[fa]][]==fa]=x;
    pre[x]=pre[fa];
    pre[fa]=x;
    ch[x][kind]=fa;
    pushup(fa);
    pushup(x);
}
void splay(int r,int goal){
    while(pre[r]!=goal){
        if(pre[pre[r]]==goal) rotate(r,ch[pre[r]][]==r);
        else {
            int fa=pre[r];
            int kind=ch[pre[fa]][]==fa;//fa的旋转方向,与fa所在子树相反
            if(ch[fa][kind]==r){rotate(r,!kind);rotate(r,kind);}
            else{rotate(fa,kind);rotate(r,kind);}
        }
    }
    if(goal==) root=r;
    pushup(r);
}
void init(){
    root=tot=;
    ch[root][]=ch[root][]=pre[root]=size[root]=num[root]=key[root]=;
}
void insert(int k,int val){//插入键值为k的结点
    int r=root;
    if(r==) {newnode(root,,k,val);pushup(root);return;}
    while(ch[r][key[r]<k]) r=ch[r][key[r]<k];
    newnode(ch[r][key[r]<k],r,k,val);
    splay(ch[r][key[r]<k],);//把k提上去作为根
    pushup(r);
}
int getth(int r,int pos){//返回第pos个结点的
    int t=size[ch[r][]]+;
    if(pos==t) return r;
    else if(pos<t) getth(ch[r][],pos);
    else getth(ch[r][],pos-t);
}
void remove(){//删除根节点
    if(ch[root][]==){root=ch[root][];pre[root]=;}//只有右子树
    else {
        int tmp=getth(ch[root][],size[ch[root][]]);
        splay(tmp,root);
        ch[tmp][]=ch[root][];
        pre[ch[root][]]=tmp;
        root=tmp;
        pre[root]=;
    }
    pushup(root);
}
int main(){
    int op,k,p;
    init();//建立一颗空树
    while(scanf("%d",&op)&&op){
        if(op==){//最大值
            if(root==) {
                puts("");
                continue;
            }
            int ans=getth(root,size[root]);
            splay(ans,);
            printf("%d\n",num[ans]);
            remove();
            //debug();
        }
        else if(op==){
            if(root==){
                puts("");
                continue;
            }
            int ans=getth(root,);
            splay(ans,);
            printf("%d\n",num[ans]);
            remove();
            //debug();
        }
        else {
            scanf("%d%d",&k,&p);
            insert(p,k);//p是关键字，k是值
            //debug();
        }
    }
    return ;
}

终于过了：和上面做法有些不同，找到最大或最小的点，将其作为根，同时将前驱后缀提取出来当做子树

/*

*/
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define maxn 100005
#define inf 0x3f3f3f3f
int pre[maxn],ch[maxn][],nums[maxn],keys[maxn],size[maxn],tot,root;

inline void newnode(int &r,int fa,int k,int val){
    r=++tot;
    ch[r][]=ch[r][]=;
    pre[r]=fa;
    size[r]=;
    nums[r]=val;
    keys[r]=k;
}
void init(){
    tot=root=;
    pre[root]=ch[root][]=ch[root][]=size[root]=;
}
inline void pushup(int x){
    size[x]=size[ch[x][]]+size[ch[x][]]+;
}
inline void rotate(int x,int kind){
    int fa=pre[x];
    ch[fa][!kind]=ch[x][kind];
    pre[ch[x][kind]]=fa;
    pre[x]=pre[fa];
    if(pre[fa])
        ch[pre[fa]][ch[pre[fa]][]==fa]=x;
    ch[x][kind]=fa;
    pre[fa]=x;
    pushup(fa);
    pushup(x);
}
inline void splay(int x,int goal){
    while(pre[x]!=goal){
        if(pre[pre[x]]==goal) rotate(x,ch[pre[x]][]==x);
        else {
            int fa=pre[x];
            int kind=ch[pre[fa]][]==fa;
            if(ch[fa][kind]==x){
                rotate(x,!kind);
                rotate(x,kind);
            }
            else {
                rotate(fa,kind);
                rotate(x,kind);
            }
        }
    }
    pushup(x);
    if(goal==) root=x;
}
int find(int key){
    if(root==) return ;
    int x=root;
    while(x && keys[x]!=key)
        x=ch[x][key>keys[x]];
    if(x) splay(x,);
    return x;
}
int prev(){
    int x=ch[root][];
    if(x==) return ;//ÎÞÇ°Çý
    while(ch[x][])
        x=ch[x][];
    return x;
}
int succ(){
    int x=ch[root][];
    if(x==) return ;//ÎÞºó¼Ì
    while(ch[x][])
        x=ch[x][];
    return x;
}
void insert(int key,int num){
    if(root==) {newnode(root,,key,num);return;}
    int x=root,lastx=;
    while(x){
        lastx=x;
        x=ch[x][key>keys[x]];
    }
    newnode(x,lastx,key,num);
    ch[lastx][key>keys[lastx]]=x;
    pre[x]=lastx;
    splay(x,);
}

void del(int key){
    int x=find(key);
    if(x==) return;
    int tmp1=prev(),tmp2=succ();
    if(!tmp1 && !tmp2){root=;return;}
    if(!tmp1){//Ö»ÓÐÓÒ×ÓÊ÷
        splay(tmp2,);
        ch[tmp2][]=;
        pushup(tmp2);
        return;
    }
    if(!tmp2){//Ö»ÓÐ×ó×ÓÊ÷
        splay(tmp1,);
        ch[tmp1][]=;
        pushup(tmp1);
        return;
    }
    splay(tmp1,);
    splay(tmp2,tmp1);
    ch[tmp2][]=;
    pushup(tmp2);pushup(tmp1);
}
int getth(int x,int pos){
    if(root==) return ;
    int t=size[ch[x][]]+;
    if(pos==t) return x;
    else if(pos<t) return getth(ch[x][],pos);
    else return getth(ch[x][],pos-t);
}
int main(){
    int p,key,num,x;
    while(scanf("%d",&p)&&p){
        switch(p){
            case :
                scanf("%d%d",&num,&key);
                insert(key,num);
                break;
            case :
                x=getth(root,size[root]);
                if(x){
                    printf("%d\n",nums[x]);
                    del(keys[x]);
                }
                else printf("0\n");
                break;
            case :
                x=getth(root,);
                if(x){
                    printf("%d\n",nums[x]);
                    del(keys[x]);
                }
                else printf("0\n");
        }
    }
    return ;
}