【BZOJ1500】【Noi2005】维修数列

题意原题很清楚了。

解题思路：裸的平衡树操作，注意动态开点即可。

细节还是比较多的，具体参见代码吧。。。

#include <stdio.h>
#include <algorithm>
#define r register
#define max(a,b) ((a)>(b)?(a):(b))
inline int in(){
    r int x=;r bool f=;r char c;
    for (;(c=getchar())<''||c>'';) f=c=='-';
    for (x=c-'';(c=getchar())>=''&&c<='';) x=(x<<)+(x<<)+c-'';
    return f?-x:x;
}
namespace Treap{
    inline int Rand(){
        static int x=;
        return x^=x<<,x^=x>>,x^=x<<;
    }
    struct node{
        node *ls,*rs; bool rev,sam;
        int val,sz,pri,sum,lx,rx,mx;
        node(int x):val(x),sz(),pri(Rand()){sum=mx=lx=rx=val,rev=sam=,ls=rs=NULL;}
        inline void reverse(){
            std::swap(ls,rs);
            if(ls) ls->rev^=,std::swap(ls->lx,ls->rx);
            if(rs) rs->rev^=,std::swap(rs->lx,rs->rx);
        }
        inline void combine(){
            sum=mx=lx=rx=val;
            sz=;
            if(ls) sum+=ls->sum,sz+=ls->sz;
            if(rs) sum+=rs->sum,sz+=rs->sz;
            if(ls){
                lx=ls->lx;
                lx=max(lx,ls->sum+val);
                if(rs) lx=max(lx,ls->sum+val+rs->lx);
            }else if(rs) lx=max(lx,val+rs->lx);
            if(rs){
                rx=rs->rx;
                rx=max(rx,rs->sum+val);
                if(ls) rx=max(rx,rs->sum+val+ls->rx);
            }else if(ls) rx=max(rx,val+ls->rx);
            if(ls){
                mx=max(mx,ls->mx);
                mx=max(mx,ls->rx+val);
            }
            if(rs){
                mx=max(mx,rs->mx);
                mx=max(mx,rs->lx+val);
            }
            if(ls&&rs) mx=max(mx,ls->rx+val+rs->lx);
        }
        inline void pushdown(){
            if (sam){
                if (ls){
                    ls->val=val;
                    ls->sum=ls->sz*val;
                    ls->sam=;
                    if (val>) ls->mx=ls->lx=ls->rx=ls->sum;
                    else ls->mx=ls->lx=ls->rx=val;
                }
                if (rs){
                    rs->val=val;
                    rs->sum=rs->sz*val;
                    rs->sam=;
                    if (val>) rs->mx=rs->lx=rs->rx=rs->sum;
                    else rs->mx=rs->lx=rs->rx=val;
                }sam=;
            }
            if (rev) reverse(),rev=;
        }
    }*root;
    struct Droot{node *a,*b;};
    inline int Size(node *x){return x?x->sz:;}
    node *merge(node *a,node *b){
        if (!a) return b;
        if (!b) return a;
        if (a->pri<b->pri){
            a->pushdown();
            a->rs=merge(a->rs,b);
            a->combine();
            return a;
        }else{
            b->pushdown();
            b->ls=merge(a,b->ls);
            b->combine();
            return b;
        }
    }
    Droot split(node *x,int k){
        if (!x) return (Droot){NULL,NULL};
        r Droot y; x->pushdown();
        if (Size(x->ls)>=k){
            y=split(x->ls,k);
            x->ls=y.b;
            x->combine();
            y.b=x;
        }else{
            y=split(x->rs,k-Size(x->ls)-);
            x->rs=y.a;x->combine();y.a=x;
        }return y;
    }
    inline void trash(node *&x){
        if (!x) return;
        trash(x->ls),trash(x->rs);
        delete x;x=NULL;
    }
    inline int Get_Sum(int s,int l){
        if (l==) return ;
        r Droot x=split(root,s-);
        r Droot y=split(x.b,l);
        r int ans=y.a->sum;
        root=merge(merge(x.a,y.a),y.b);
        return ans;
    }
    inline int Get_Max(){return root?root->mx:;}
    inline void Delete(int s,int l){
        r Droot x=split(root,s-);
        r Droot y=split(x.b,l);
        root=merge(x.a,y.b);trash(y.a);
    }
    inline void Make_Same(int s,int l,int val){
        r Droot x=split(root,s-);
        r Droot y=split(x.b,l);
        y.a->val=val;y.a->sam=;y.a->rev=,y.a->sum=y.a->sz*val;
        if (val>) y.a->mx=y.a->lx=y.a->rx=y.a->sum;
        else y.a->mx=y.a->lx=y.a->rx=val;
        root=merge(merge(x.a,y.a),y.b);
    }
    inline void Reverse(int s,int l){
        r Droot x=split(root,s-);
        r Droot y=split(x.b,l);
        y.a->rev=; std::swap(y.a->lx,y.a->rx);
        root=merge(merge(x.a,y.a),y.b);
    }
    inline node *insert(int k){
        if (!k) return NULL;
        if (k==){
            r node *ans=new node(in());
            return ans;
        }
        r node *a,*b;
        a=insert(k>>);
        b=insert(k-(k>>));
        return merge(a,b);
    }
    inline void Insert(){
        r int pos=in(),n=in();
        r node *ans=insert(n);
        r Droot x=split(root,pos);
        root=merge(merge(x.a,ans),x.b);
    }
}using namespace Treap;int n,q;
void init(){n=in(),q=in();root=insert(n);}
void solve(){
    while(q--){
        r char op[];scanf("%s",op);
        if (op[]=='M'){
            if (op[]=='K'){
                r int x=in(),n=in();
                Make_Same(x,n,in());
            }else printf("%d\n",Get_Max());
        }
        else{
            switch(op[]){
                case 'I':Insert();break;
                case 'D':{r int x=in();Delete(x,in());break;}
                case 'R':{r int x=in();Reverse(x,in());break;}
                case 'G':{r int x=in();printf("%d\n",Get_Sum(x,in()));break;}
            }
        }
    }
}
int main(){init(); solve(); return ;}