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=0; register char ch=getchar(); int f=1;
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();} x*=f;
}
inline void Put_Int(int x)
{
    char ch[20]; register int top=0;
    if (x<0) putchar('-'),x=-x;
    if (x==0) ch[++top]='0';
    while (x) ch[++top]=x%10+'0',x/=10;
    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=0;i<4;i++) if (S1[i]!=S2[i]) return false; return true;}
//=============================================
const int Maxn=600010;
const int Inf=0x3f3f3f3f;
int a[Maxn],pos,tot,c,n,m,Point;
char str[30];
struct Node
{
    int lx,rx,mx,sum,size,key,rev,same;
    Node * pre,* ch[2];
    inline int d() {return this->pre->ch[1]==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[0]=ret->ch[1]=null;
    ret->size=1,ret->pre=f;
    ret->key=ret->lx=ret->rx=ret->mx=ret->sum=v;
    ret->same=ret->rev=0;
    return ret;
}
inline void Get_Rev(Node * x)
{
    if (x==null) return;
    Swap(x->ch[0],x->ch[1]);
    Swap(x->lx,x->rx);
    x->rev^=1;
}
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=1;
}
inline void Push_Up(Node * x)
{
    if (x==null) return;
    x->size=x->ch[0]->size+x->ch[1]->size+1;
    x->sum=x->ch[0]->sum+x->ch[1]->sum+x->key;
    x->lx=Max(x->ch[0]->lx,x->ch[0]->sum+x->key+Max(x->ch[1]->lx,0));
    x->rx=Max(x->ch[1]->rx,x->ch[1]->sum+x->key+Max(x->ch[0]->rx,0));
    x->mx=Max3(x->ch[0]->mx,x->ch[1]->mx,Max(x->ch[0]->rx,0)+x->key+Max(x->ch[1]->lx,0));
}
inline void Push_Down(Node * x)
{
    if (x==null) return;
    if (x->rev)
    {
        Get_Rev(x->ch[0]);
        Get_Rev(x->ch[1]);
        x->rev=0;
    }
    if (x->same)
    {
        Get_Same(x->ch[0],x->key);
        Get_Same(x->ch[1],x->key);
        x->same=0;
    }
}
Node * Build(int l,int r,Node * f)
{
    if (l>r) return null;
    int mid=(l+r)>>1;
    Node * ret=NewNode(f,a[mid]);
    ret->ch[0]=Build(l,mid-1,ret);
    ret->ch[1]=Build(mid+1,r,ret);
    Push_Up(ret);
    return ret;
}
inline void Init()
{
    null->ch[0]=null->ch[1]=null->pre=null;
    null->size=null->key=null->sum=null->same=null->rev=0;
    null->lx=null->rx=null->mx=-Inf; 
    Root=NewNode(null,-1);
    Root->ch[1]=NewNode(Root,-1);
    for (int i=1;i<=n;i++) Get_Int(a[i]);
    Key=Build(1,n,Root->ch[1]);
    Push_Up(Root->ch[1]),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=1; tmp[1]=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[0]->size+1;
    if (t==k) return x;
    if (t>k) return Get_K(x->ch[0],k);
    else return Get_K(x->ch[1],k-t);
}
inline void Handle(int pos,int tot)
{
    Splay(Get_K(Root,pos),null);
    Splay(Get_K(Root,pos+tot+1),Root);
}
inline void Insert()
{
    Get_Int(pos),Get_Int(n);
    Handle(pos+1,0);
    for (int i=1;i<=n;i++) Get_Int(a[i]);
    Key=Build(1,n,Root->ch[1]);
    Push_Up(Root->ch[1]),Push_Up(Root);
}
void Erase(Node * x)
{
    if (x==null) return;
    Erase(x->ch[0]),Erase(x->ch[1]);
    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[1]),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[1]),Push_Up(Root);
}
inline void Rev()
{
    Get_Int(pos),Get_Int(tot);
    Handle(pos,tot);
    Get_Rev(Key);
    Push_Up(Root->ch[1]),Push_Up(Root);
}
inline void Sum()
{
    Get_Int(pos),Get_Int(tot);
    Handle(pos,tot);
    Put_Int(Key->sum);
}
inline void MaxSum()
{
    Handle(1,Root->size-2);
    Put_Int(Key->mx);
}
void InOrder(Node * x)
{
    if (x==null) return;
    Push_Down(x);
    InOrder(x->ch[0]);
    printf("%d ",x->key);
    InOrder(x->ch[1]);
}

int main()
{
    Get_Int(n),Get_Int(m);
    Init();
    for (int i=1;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 0;
}