【Luogu】P1110报表统计（Splay）

　　题目链接

　　SBT，我居然没看出来。

　　就是插入的时候考虑向平衡树里插两个差值，删一个差值。

　　另一个操作就是维护某元素和其前驱后继的差值最小值就行了。

　　然后Splay超时了……

　　（貌似Splay超时了之后我都是修改splay操作的频率暴力硬卡，而不是考虑换一种思路……

　　然后就被我卡过了。

　　

// luogu-judger-enable-o2
// luogu-judger-enable-o2
// luogu-judger-enable-o2
// luogu-judger-enable-o2
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<cstdlib>
#define maxn 700010
using namespace std;
inline long long read(){
    long long num=,f=;
    char ch=getchar();
    while(!isdigit(ch)){
        if(ch=='-')    f=-;
        ch=getchar();
    }
    while(isdigit(ch)){
        num=num*+ch-'';
        ch=getchar();
    }
    return num*f;
}

int CNT=;
struct Splay{
    struct Node{
        int val,fa,e[],size,sum;
    }tree[maxn];
    int point,tot,root;
    Splay(){point=tot=root=;    }
    inline void update(int x){    tree[x].size=tree[tree[x].e[]].size+tree[tree[x].e[]].size+tree[x].sum;    }
    inline void connect(int x,int fa,int how){    tree[x].fa=fa;    tree[fa].e[how]=x;    }
    inline int iden(int x){    return x==tree[tree[x].fa].e[];    }
    inline void rotate(int x){
        int y=tree[x].fa;int r=tree[y].fa;
        if(y==root)    root=x;
        int sony=iden(x);int sonr=iden(y);
        int b=tree[x].e[sony^];
        connect(b,y,sony);
        connect(y,x,sony^);
        connect(x,r,sonr);
        update(y);    update(x);
    }
    void splay(int pos,int to){
        to=tree[to].fa;
        while(tree[pos].fa!=to){
            if(tree[tree[pos].fa].fa==to)    rotate(pos);
            else
                if(iden(pos)==iden(tree[pos].fa)){
                    rotate(tree[pos].fa);
                    rotate(pos);
                }
                else{    rotate(pos);    rotate(pos);    }
        }
    }
    int create(int val,int fa){
        tree[++tot].val=val;    tree[tot].fa=fa;
        tree[tot].size=tree[tot].sum=;
        return tot;
    }
    int build(int val){
        point++;
        if(root==){    root=create(val,);    return root;    }
        int now=root;
        while(){
            tree[now].size++;
            if(tree[now].val==val){    tree[now].sum++;    return now;    }
            int nxt=tree[now].val>val?:;
            if(tree[now].e[nxt]==){
                connect(create(val,now),now,nxt);
                update(now);
                return tot;
            }
            now=tree[now].e[nxt];
        }
    }
    void insert(int val){
        int p=build(val);
        if(++CNT=){
            CNT=;
            splay(p,root);
        }
    }
    int find(int val){
        int now=root;
        while(now){
            if(tree[now].val==val)    return now;
            int nxt=val<tree[now].val?:;
            now=tree[now].e[nxt];
        }
        return ;
    }
    inline void dele(int x){
        tree[x].e[]=tree[x].e[]=tree[x].fa=;
        if(x==tot)    tot--;
    }
    void pop(int val){
        int deal=find(val);
        if(deal==)    return;
        splay(deal,root);
        if(tree[deal].sum>){
            tree[deal].size--;    tree[deal].sum--;
            return;
        }
        if(tree[deal].e[]==){
            root=tree[deal].e[];
            tree[root].fa=;
        }
        else{
            int le=tree[deal].e[];
            while(tree[le].e[])    le=tree[le].e[];
            splay(le,tree[deal].e[]);
            connect(tree[deal].e[],le,);    connect(le,,);
            update(le);
            root=le;
        }
        dele(deal);
    }
    int rank(int val){
        int now=root,ans=;
        while(now){
            if(tree[now].val==val)    return ans+tree[tree[now].e[]].size+;
            int nxt=val<tree[now].val?:;
            if(nxt==)    now=tree[now].e[];
            else{
                ans+=tree[tree[now].e[]].size+tree[now].sum;
                now=tree[now].e[];
            }
        }
    }
    inline int arank(){
        int now=root;
        while(tree[now].e[])   now=tree[now].e[];
        if(++CNT==){
            splay(now,root);
            CNT=;
        }
        return tree[now].val;
    }
    int lower(int val){
        int ans=-,now=root;
        while(now){
            if(tree[now].val==val){
                splay(now,root);
                return val;
            }
            if(tree[now].val<val&&tree[now].val>ans)    ans=tree[now].val;
            if(tree[now].val>val)        now=tree[now].e[];
            else                        now=tree[now].e[];
        }
        return ans;
    }
    int upper(int val){
        int ans=,now=root;
        while(now){
            if(tree[now].val==val)    return val;
            if(tree[now].val>val&&tree[now].val<ans)    ans=tree[now].val;
            if(tree[now].val<val)        now=tree[now].e[];
            else                        now=tree[now].e[];
        }
        return ans;
    }
}s,d;

int q[maxn];
int w[maxn];
int ans=;
int main(){
    int n=read(),m=read();
    for(int i=;i<=n;++i){
        q[i]=w[i]=read();
        if(i!=)    s.insert(abs(q[i]-q[i-]));
        int now=min(abs(d.lower(q[i])-q[i]),abs(d.upper(q[i])-q[i]));
        d.insert(q[i]);
        if(now<ans)    ans=now;
    }
    for(register int i=;i<=m;++i){
        char ch[];
        scanf("%s",ch);
        switch(ch[]){
            case 'R':{
                int a=read(),b=read();
                s.pop(abs(w[a]-q[a+]));
                s.insert(abs(w[a]-b));
                s.insert(abs(b-q[a+]));
                w[a]=b;
                int now=min(abs(d.lower(b)-b),abs(d.upper(b)-b));
                if(now<ans)    ans=now;
                d.insert(b);
                break;
            }
            case 'G':printf("%d\n",s.arank());    break;
            case 'S':printf("%d\n",ans);    break;
        }
    }
    return ;
}