BZOJ 1500 Splay 全操作

好久没写splay了，写一发(写了一节课，调了一节课)

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <algorithm>
 #include <vector>
 #include <map>
 #include <set>
 #include <stack>
 #define mp make_pair
 #define pa pair<int,int>
 #define pb push_back
 #define fi first
 #define se second
 #define Key Root->ch[1]->ch[0]
 using namespace std;
 inline void Get_Int(int &x)
 {
     x=; register char ch=getchar(); int f=;
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();} x*=f;
 }
 inline void Put_Int(int x)
 {
     char ch[]; register int top=;
     if (x<) putchar('-'),x=-x;
     if (x==) ch[++top]='';
     while (x) ch[++top]=x%+'',x/=;
     while (top) putchar(ch[top--]); putchar('\n');
 }
 inline int Max(int x,int y) {return x>y?x:y;}
 inline int Max3(int x,int y,int z) {return Max(x,Max(y,z));}
 inline void Swap(int &x,int &y) {int t=x;x=y;y=t;}
 inline bool StrCmp(char S1[],char S2[]) {for (int i=;i<;i++) if (S1[i]!=S2[i]) return false; return true;}
 //=============================================
 const int Maxn=;
 const int Inf=0x3f3f3f3f;
 int a[Maxn],pos,tot,c,n,m,Point;
 char str[];
 struct Node
 {
     int lx,rx,mx,sum,size,key,rev,same;
     Node * pre,* ch[];
     inline int d() {return this->pre->ch[]==this;}
     inline void Setc(Node * r,int d) {r->pre=this; this->ch[d]=r;}
 };
 inline void Swap(Node *&x,Node *&y) {Node * T=x;x=y;y=T;}
 Node Memory[Maxn],* port=Memory,* tmp[Maxn],* Bin[Maxn],* null=port++,* Root;
 inline Node * NewNode(Node * f,int v)
 {
     Node * ret;
     if (Point) ret=Bin[Point--]; else ret=port++;
     ret->ch[]=ret->ch[]=null;
     ret->size=,ret->pre=f;
     ret->key=ret->lx=ret->rx=ret->mx=ret->sum=v;
     ret->same=ret->rev=;
     return ret;
 }
 inline void Get_Rev(Node * x)
 {
     if (x==null) return;
     Swap(x->ch[],x->ch[]);
     Swap(x->lx,x->rx);
     x->rev^=;
 }
 inline void Get_Same(Node * x,int v)
 {
     if (x==null) return;
     x->key=v;
     x->sum=x->size*v;
     x->lx=x->rx=x->mx=Max(v,x->size*v);
     x->same=;
 }
 inline void Push_Up(Node * x)
 {
     if (x==null) return;
     x->size=x->ch[]->size+x->ch[]->size+;
     x->sum=x->ch[]->sum+x->ch[]->sum+x->key;
     x->lx=Max(x->ch[]->lx,x->ch[]->sum+x->key+Max(x->ch[]->lx,));
     x->rx=Max(x->ch[]->rx,x->ch[]->sum+x->key+Max(x->ch[]->rx,));
     x->mx=Max3(x->ch[]->mx,x->ch[]->mx,Max(x->ch[]->rx,)+x->key+Max(x->ch[]->lx,));
 }
 inline void Push_Down(Node * x)
 {
     if (x==null) return;
     if (x->rev)
     {
         Get_Rev(x->ch[]);
         Get_Rev(x->ch[]);
         x->rev=;
     }
     if (x->same)
     {
         Get_Same(x->ch[],x->key);
         Get_Same(x->ch[],x->key);
         x->same=;
     }
 }
 Node * Build(int l,int r,Node * f)
 {
     if (l>r) return null;
     int mid=(l+r)>>;
     Node * ret=NewNode(f,a[mid]);
     ret->ch[]=Build(l,mid-,ret);
     ret->ch[]=Build(mid+,r,ret);
     Push_Up(ret);
     return ret;
 }
 inline void Init()
 {
     null->ch[]=null->ch[]=null->pre=null;
     null->size=null->key=null->sum=null->same=null->rev=;
     null->lx=null->rx=null->mx=-Inf;
     Root=NewNode(null,-);
     Root->ch[]=NewNode(Root,-);
     for (int i=;i<=n;i++) Get_Int(a[i]);
     Key=Build(,n,Root->ch[]);
     Push_Up(Root->ch[]),Push_Up(Root);
 }
 //=========================================================
 inline void Rotate(Node * x)
 {
     Node * y=x->pre; int d=x->d();
     y->pre->Setc(x,y->d());
     y->Setc(x->ch[!d],d);
     x->Setc(y,!d);
     Push_Up(y);
 }
 void Splay(Node * x,Node * Goal)
 {
     int s=; tmp[]=x; Node * r=x;
     while (r->pre!=null) tmp[++s]=r=r->pre;
     while (s) Push_Down(tmp[s--]);
     while (x->pre!=Goal)
         if (x->pre->pre==Goal) Rotate(x); else
             (x->pre->d()==x->d())?(Rotate(x->pre),Rotate(x)):(Rotate(x),Rotate(x));
     Push_Up(x);
     if (Goal==null) Root=x;
 }
 //===========================================================
 Node * Get_K(Node * x,int k)
 {
     Push_Down(x);
     int t=x->ch[]->size+;
     if (t==k) return x;
     if (t>k) return Get_K(x->ch[],k);
     else return Get_K(x->ch[],k-t);
 }
 inline void Handle(int pos,int tot)
 {
     Splay(Get_K(Root,pos),null);
     Splay(Get_K(Root,pos+tot+),Root);
 }
 inline void Insert()
 {
     Get_Int(pos),Get_Int(n);
     Handle(pos+,);
     for (int i=;i<=n;i++) Get_Int(a[i]);
     Key=Build(,n,Root->ch[]);
     Push_Up(Root->ch[]),Push_Up(Root);
 }
 void Erase(Node * x)
 {
     if (x==null) return;
     Erase(x->ch[]),Erase(x->ch[]);
     Bin[++Point]=x;
 }
 inline void Delete()
 {
     Get_Int(pos),Get_Int(tot);
     Handle(pos,tot);
     Erase(Key); Key->pre=null; Key=null;
     Push_Up(Root->ch[]),Push_Up(Root);
 }
 inline void Same()
 {
     Get_Int(pos),Get_Int(tot),Get_Int(c);
     Handle(pos,tot);
     Get_Same(Key,c);
     Push_Up(Root->ch[]),Push_Up(Root);
 }
 inline void Rev()
 {
     Get_Int(pos),Get_Int(tot);
     Handle(pos,tot);
     Get_Rev(Key);
     Push_Up(Root->ch[]),Push_Up(Root);
 }
 inline void Sum()
 {
     Get_Int(pos),Get_Int(tot);
     Handle(pos,tot);
     Put_Int(Key->sum);
 }
 inline void MaxSum()
 {
     Handle(,Root->size-);
     Put_Int(Key->mx);
 }
 void InOrder(Node * x)
 {
     if (x==null) return;
     Push_Down(x);
     InOrder(x->ch[]);
     printf("%d ",x->key);
     InOrder(x->ch[]);
 }

 int main()
 {
     Get_Int(n),Get_Int(m);
     Init();
     for (int i=;i<=m;i++)
     {
         scanf("%s",str);
         if (StrCmp(str,"INSERT")) Insert();
         if (StrCmp(str,"DELETE")) Delete();
         if (StrCmp(str,"MAKE-SAME")) Same();
         if (StrCmp(str,"REVERSE")) Rev();
         if (StrCmp(str,"GET-SUM")) Sum();
         if (StrCmp(str,"MAX-SUM")) MaxSum();
     }
     return ;
 }

傻逼200+系列..