[LG1503] 鬼子进村 - 平衡树

考虑维护每个被摧毁的点，摧毁时入栈，修复时弹出栈并在平衡树中删除之。对于询问，求前驱后继之差即可，注意询问点为已存在的特判。

---

#include<cstdio>
#include<vector>
using namespace std;
int fa[50005]={},ch[50005][2]={},k[50005]={},ind=0,root=0,m,n;
int search(int v){int p=root;for(;p&&k[p]-v;p=ch[p][k[p]<v]);return p;}
void rotate(int p){int q=fa[p],y=fa[q],x=ch[q][1]==p;ch[q][x]=ch[p][x^1];fa[ch[q][x]]=q;ch[p][x^1]=q;fa[q]=p;fa[p]=y;if(y)if(ch[y][0]==q)ch[y][0]=p;else ch[y][1]=p;}
void splay(int x){for(int y;y=fa[x];rotate(x))if(fa[y])rotate((x==ch[y][0])==(y==ch[fa[y]][0])?y:x);root=x;}
void insert(int v){if(!root)root=++ind,k[root]=v,fa[root]=ch[root][0]=ch[root][1]=0;else{int x=root,y;for(;y=ch[x][k[x]<v];x=y);y=++ind,k[y]=v,fa[y]=x,ch[y][0]=ch[y][1]=0,ch[x][k[x]<v]=y;splay(y);}} 
void remove(int p){if(!p)return;splay(p);int l=ch[p][0],r=ch[p][1],t;fa[l]=fa[r]=ch[p][0]=ch[p][1]=0;if(!l){root=r;return;}for(t=l;ch[t][1];t=ch[t][1]);splay(t);ch[t][1]=r;fa[r]=t;}
int prefix(int p){splay(p);int t=ch[p][0];for(;ch[t][1];t=ch[t][1]);return t;}
int suffix(int p){splay(p);int t=ch[p][1];for(;ch[t][0];t=ch[t][0]);return t;}
int main(){
    char c[2];int t;vector<int>v;v.push_back(-1);
    scanf("%d%d",&n,&m);insert(0),insert(n+1);
    for(int i=0;i<m;i++){
        scanf("%s",&c);if(c[0]!='R')scanf("%d",&t);
        switch(c[0]){
            case 'D':insert(t);v.push_back(t);break;
            case 'R':remove(search(v[v.size()-1]));v.pop_back();break;
            case 'Q':if(search(t))printf("0\n");
                     else{insert(t);printf("%d\n",k[suffix(search(t))]-k[prefix(search(t))]-1);remove(search(t));break;}}}
    return 0;
}