bzoj 1503 splay

因为是整体加减，所以直接记录在外面。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define inf 0x3f3f3f3f
 #define N 1000005
 using namespace std;
 int sum;
 int li,root;
 int cnt,size[N],ch[N][],fa[N],n,m,k[N];
 void push_up(int x)
 {
     size[x]=size[ch[x][]]+size[ch[x][]]+;
 }
 void rotate(int p)
 {
     int q=fa[p],y=fa[q],x=(ch[q][]==p);
     ch[q][x]=ch[p][x^];fa[ch[q][x]]=q;
     ch[p][x^]=q;fa[q]=p;fa[p]=y;
     if(y)
     {
         if(ch[y][]==q)ch[y][]=p;
         else ch[y][]=p;
     }
     push_up(q);
     return ;
 }
 void splay(int x)
 {
     for(int y;y=fa[x];rotate(x))
     {
         if(fa[y])
         {
             if((ch[y][]==x&&ch[fa[y]][]==y)||(ch[y][]==x&&ch[fa[y]][]==y))rotate(y);
             else rotate(x);
         }
     }
     push_up(x);root=x;
 }
 void del(int x)
 {
     splay(x);
     if(!ch[x][])
     {
         root=ch[x][];fa[ch[x][]]=;
     }
     else if(!ch[x][])
     {
         root=ch[x][],fa[ch[x][]]=;
     }
     else
     {
         int tmp=ch[x][];fa[tmp]=;
         while(ch[tmp][])tmp=ch[tmp][];
         splay(tmp);ch[tmp][]=ch[x][];fa[ch[x][]]=tmp;
         push_up(tmp);
     }return ;
 }
 int find(int x,int kk)
 {
     //cout<<kk<<endl;
     if(size[ch[x][]]+==kk)return k[x];
     if(size[ch[x][]]>=kk)return find(ch[x][],kk);
     return find(ch[x][],kk-size[ch[x][]]-);
 }
 void insert(int z)
 {
     //cout<<z<<endl;
     int x=root;size[x]++;
     while(ch[x][k[x]<z])x=ch[x][k[x]<z],size[x]++;
     ch[x][k[x]<z]=++cnt;k[cnt]=z;size[cnt]=;fa[cnt]=x;splay(cnt);
 }
 int mn()
 {
     int tmp=root;while(ch[tmp][])tmp=ch[tmp][];
     return tmp;
 }
 int main()
 {
     //freopen("out.txt","w",stdout);
     int now=;
     scanf("%d%d",&n,&m);
     cnt=;k[]=inf;sum=;size[]=;root=;
     for(int i=;i<=n;i++)
     {
         char c[];int tmp;
         scanf("%s%d",c,&tmp);
         if(c[]=='I')
         {
             if(tmp<m)continue;
             else now++,insert(tmp-sum);
         }
         else if(c[]=='A')
         {
             sum+=tmp;
         }
         else if(c[]=='S')
         {
             sum-=tmp;
             while()
             {
               //cout<<root<<endl;
               int u=mn();
               if(k[u]+sum<m)
               {
                 li++;
                 del(u);continue;
               }
               break;
             }
         }
         else if(c[]=='F')
         {
             if(tmp>now-li)
             {
                 puts("-1");continue;
             }
             printf("%d\n",find(root,now-li-tmp+)+sum);
         }
     }
     printf("%d\n",li);
     return ;
 }