POJ 3580 SuperMemo [Splay]

题意：给出一个长度为N的序列，维护6种操作，操作数为M：

ADD x y D: Add D to each number in sub-sequence {Ax ... Ay}. For example, performing "ADD 2 4 1" on {1, 2, 3, 4, 5} results in {1, 3, 4, 5, 5}
REVERSE x y: reverse the sub-sequence {Ax ... Ay}. For example, performing "REVERSE 2 4" on {1, 2, 3, 4, 5} results in {1, 4, 3, 2, 5}
REVOLVE x y T: rotate sub-sequence {Ax ... Ay} T times. For example, performing "REVOLVE 2 4 2" on {1, 2, 3, 4, 5} results in {1, 3, 4, 2, 5}
INSERT x P: insert P after Ax. For example, performing "INSERT 2 4" on {1, 2, 3, 4, 5} results in {1, 2, 4, 3, 4, 5}
DELETE x: delete Ax. For example, performing "DELETE 2" on {1, 2, 3, 4, 5} results in {1, 3, 4, 5}
MIN x y: query the participant what is the minimum number in sub-sequence {Ax ... Ay}. For example, the correct answer to "MIN 2 4" on {1, 2, 3, 4, 5} is 2

范围：N,M<=10W

解法：splay模板题，维护信息时小心0号节点的信息，不要push进去然后update了，并且在cut某段区间时，要对父节点重新进行维护，否则可能会WA或者TLE。因为数组写法，所以时间多跑了50%（orz，为什么会慢这么多）；

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<bitset>
#pragma comment(linker, "/STACK:1024000000,1024000000")
template <class T>
bool scanff(T &ret){ //Faster Input
    char c; int sgn; T bit=0.1;
    if(c=getchar(),c==EOF) return 0;
    while(c!='-'&&c!='.'&&(c<'0'||c>'9')) c=getchar();
    sgn=(c=='-')?-1:1;
    ret=(c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
    if(c==' '||c=='\n'){ ret*=sgn; return 1; }
    while(c=getchar(),c>='0'&&c<='9') ret+=(c-'0')*bit,bit/=10;
    ret*=sgn;
    return 1;
}
#define inf 1073741823
#define llinf 4611686018427387903LL
#define PI acos(-1.0)
#define lth (th<<1)
#define rth (th<<1|1)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define drep(i,a,b) for(int i=int(a);i>=int(b);i--)
#define gson(i,root) for(int i=ptx[root];~i;i=ed[i].next)
#define tdata int testnum;scanff(testnum);for(int cas=1;cas<=testnum;cas++)
#define mem(x,val) memset(x,val,sizeof(x))
#define mkp(a,b) make_pair(a,b)
#define findx(x) lower_bound(b+1,b+1+bn,x)-b
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

#define NN 400400
int val[NN],a[NN],c[NN][2],fa[NN],minx[NN],sz[NN],add[NN];
bool rev[NN];
inline void push(int x){
    int &l=c[x][0],&r=c[x][1];
    if(rev[x]){
        rev[x]=0;rev[l]^=1;rev[r]^=1;
        swap(l,r);
    }
    if(add[x]){
        val[x]+=add[x];
        if(l)add[l]+=add[x];
        if(r)add[r]+=add[x];
        add[x]=0;
    }
}
inline void update(int x){
    int l=c[x][0],r=c[x][1];
    sz[x]=sz[l]+sz[r]+1;
    minx[x]=min(min(minx[l]+add[l],minx[r]+add[r]),val[x]);
}
void rotate(int x,int &k){
    int y=fa[x],z=fa[y],l,r;
    l=(c[y][1]==x);r=l^1;
    if(y==k)k=x;
    else c[z][c[z][1]==y]=x;
    fa[y]=x;fa[c[x][r]]=y;fa[x]=z;
    c[y][l]=c[x][r];c[x][r]=y;
    update(y);update(x);
}
void splay(int x,int &k){
    for(;x!=k;){
        int y=fa[x],z=fa[y];
        if(y!=k){
            if(c[y][0]==x^c[z][0]==y)rotate(x,k);
            else rotate(y,k);
        }
        rotate(x,k);
    }
}
void build(int l,int r,int f){
    if(l>r)return;
    int m=(l+r)>>1;
    c[f][m>=f]=m;
    fa[m]=f;
    val[m]=a[m];
    build(l,m-1,m);
    build(m+1,r,m);
    update(m);
}
int findk(int x,int no){
    push(x);
    update(x);
    int l=c[x][0];
    if(sz[l]+1==no)return x;
    if(sz[l]>=no)return findk(l,no);
    return findk(c[x][1],no-sz[l]-1);
}
char op[22];
int n,m,rt,tot;
void init(){
    tot=n+2;
    rep(i,1,n+2)c[i][0]=c[i][1]=rev[i]=add[i]=0;
    rep(i,1,n)scanff(a[i+1]);
    a[1]=a[n+2]=inf;
    build(1,n+2,0);
    rt=(n+3)>>1;
}
void addv(int l,int r,int v){
    int x=findk(rt,l);
    int y=findk(rt,r+2);
    splay(x,rt);
    splay(y,c[x][1]);
    add[c[y][0]]+=v;
}
void flip(int l,int r){
    int x=findk(rt,l);
    int y=findk(rt,r+2);
    splay(x,rt);
    splay(y,c[x][1]);
    rev[c[y][0]]^=1;
}
void revolve(int l,int r,int t){
    t%=(r-l+1);
    if(!t)return;
    int x=findk(rt,r-t+1);
    int y=findk(rt,r+2);
    int lx=findk(rt,l);
    int ly=findk(rt,l+1);
    splay(x,rt);
    splay(y,c[x][1]);
    int z=c[y][0];
    c[y][0]=0;
    update(y);
    splay(lx,rt);
    splay(ly,c[lx][1]);
    c[ly][0]=z;
    fa[z]=ly;
    update(ly);
}
int getmin(int l,int r){
    int x=findk(rt,l);
    int y=findk(rt,r+2);
    splay(x,rt);
    splay(y,c[x][1]);
    int z=c[y][0];
    push(z);
    update(z);
    return minx[z];
}

void insert(int l,int v){
    int x=findk(rt,l+1);
    int y=findk(rt,l+2);
    splay(x,rt);
    splay(y,c[x][1]);
    c[y][0]=++tot;
    fa[tot]=y;
    sz[tot]=1;
    minx[tot]=val[tot]=v;
    rev[tot]=add[tot]=c[tot][0]=c[tot][1]=0;
    push(y);
    update(y);
}
void dele(int l){
    int x=findk(rt,l);
    int y=findk(rt,l+2);
    splay(x,rt);
    splay(y,c[x][1]);
    c[y][0]=0;
    push(y);
    update(y);
}
int main(){
    val[0]=inf;minx[0]=inf;add[0]=0;sz[0]=0;
    while(scanf("%d",&n)!=EOF){
        init();
        scanff(m);
        int x,y,z;
        rep(i,1,m){
            scanf("%s",op);
            if(op[0]=='R'){
                if(op[3]=='O'){
                    scanff(x);scanff(y);scanff(z);
                    revolve(x,y,z);
                }
                else {
                    scanff(x);scanff(y);
                    flip(x,y);
                }
            }
            else if(op[0]=='A'){
                scanff(x);scanff(y);scanff(z);
                addv(x,y,z);
            }

            else if(op[0]=='M'){
                scanff(x);scanff(y);
                printf("%d\n",getmin(x,y));
            }
            else if(op[0]=='I'){
                scanff(x);scanff(y);
                insert(x,y);
            }
            else if(op[0]=='D'){
                scanff(x);
                dele(x);
            }
        }
    }
    return 0;
}