POJ3580---SuperMemo （Splay）

各种操作，区间更新，求最值、翻转、插入、删除、当然是Splay这种神器了。

主要是 revolve这个操作，其实也就是3个区间翻转放到一块，

比如 REVOLVE x y T，T %= （y-x+1）; 其实就是 先把 x y区间翻转，然后把  x x + c - 1区间和 x+ c  y区间分别翻转。

代码：

#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int maxn = 1e5+100;
int siz[maxn],minv[maxn],rev[maxn],addv[maxn],key[maxn];
int ch[maxn][2],a[maxn],pre[maxn],s[maxn];
int n,tot1,tot2,root;
void NewNode(int &r,int father,int k)
{
    if (tot2)
        r = s[tot2--];
    else
        r = ++tot1;
    pre[r] = father;
    key[r] = k;
    siz[r] = 1;
    minv[r] = k;
    ch[r][0] = ch[r][1] = 0;
}
void update_Rev(int r)
{
    if (!r)
        return ;
    swap(ch[r][0],ch[r][1]);
    rev[r] ^= 1;
}
void push_up(int r)
{
    siz[r] = siz[ch[r][0]] + siz[ch[r][1]] + 1;
    minv[r] = min(key[r],min(minv[ch[r][0]],minv[ch[r][1]]));
}
void update_add(int r,int val)
{
    if (!r)
        return ;
    key[r] += val;
    addv[r] += val;
    minv[r] += val;
}
void push_down(int r)
{
    if (rev[r])
    {
        update_Rev(ch[r][0]);
        update_Rev(ch[r][1]);
        rev[r] = 0;
    }
    if (addv[r])
    {
        update_add(ch[r][0],addv[r]);
        update_add(ch[r][1],addv[r]);
        addv[r] = 0;
    }
}

void build(int &x,int l,int r,int father)
{
    if (l > r)
        return;
    int mid = (l + r) >> 1;
    NewNode(x,father,a[mid]);
    build(ch[x][0],l,mid-1,x);
    build(ch[x][1],mid+1,r,x);
    push_up(x);
}
void init()
{
    tot1 = root = tot2 = 0;
    for (int i = 1; i <= n; i++)
        scanf ("%d",a+i);
    minv[root] = inf;
    NewNode(root,0,-1);
    NewNode(ch[root][1],root,-1);
    build(ch[ch[root][1]][0],1,n,ch[root][1]);
    push_up(root);
    push_up(ch[root][1]);
}
void Rotate(int x,int kind)
{
    int y = pre[x];
    push_down(y);
    push_down(x);
    ch[y][!kind] = ch[x][kind];
    pre[ch[x][kind]] = y;
    if (pre[y])
        ch[pre[y]][ch[pre[y]][1] == y] = x;
    pre[x] = pre[y];
    ch[x][kind] = y;
    pre[y] = x;
    push_up(y);
}
void Splay(int r,int goal)
{
    push_down(r);
    while (pre[r] != goal)
    {
        if (pre[pre[r]] == goal)
        {
            push_down(pre[r]);
            push_down(r);
            Rotate(r,ch[pre[r]][0] == r);
        }
        else
        {
            int y = pre[r];
            push_down(pre[y]);
            push_down(y);
            push_down(r);
            int kind = (ch[pre[y]][1] == y);
            if (ch[y][kind] == r)
            {
                Rotate(y,!kind);
                Rotate(r,!kind);
            }
            else
            {
                Rotate(r,kind);
                Rotate(r,!kind);
            }
        }
    }
    push_up(r);
    if (goal == 0)
        root = r;
}
int Get_kth(int r,int k)
{
    push_down(r);
    int t = siz[ch[r][0]] + 1;
    if (t == k)
        return r;
    else if (t <= k)
        return Get_kth(ch[r][1],k-t);
    else
        return Get_kth(ch[r][0],k);
}
void eraser(int r)
{
    if (!r)
        return;
    s[++tot2] = r;
    eraser(ch[r][0]);
    eraser(ch[r][1]);
}
void Delete(int x)
{
    Splay(Get_kth(root,x),0);
    Splay(Get_kth(root,x+2),root);
    eraser(ch[ch[root][1]][0]);
    pre[ch[ch[root][1]][0]] = 0;
    ch[ch[root][1]][0] = 0;
    push_up(ch[root][1]);
    push_up(root);
}
void Insert(int x,int val)
{
    Splay(Get_kth(root,x+1),0);
    Splay(Get_kth(root,x+2),root);
    NewNode(ch[ch[root][1]][0],ch[root][1],val);
    push_up(ch[root][1]);
    push_up(root);
}
void ADD(int u,int v,int val)
{
    Splay(Get_kth(root,u),0);
    Splay(Get_kth(root,v+2),root);
    update_add(ch[ch[root][1]][0],val);
    push_up(ch[root][1]);
    push_up(root);
}
int query(int ua,int ub)
{
    Splay(Get_kth(root,ua),0);
    Splay(Get_kth(root,ub+2),root);
    return minv[ch[ch[root][1]][0]];
}
void Reverse (int u,int v)
{
    Splay (Get_kth(root,u),0);
    Splay (Get_kth(root,v+2),root);
    update_Rev (ch[ch[root][1]][0]);
    push_up (ch[root][1]);
    push_up (root);
}
void revolve(int u,int v,int c)
{
    int len = (v - u + 1);
    c  %= len;
    if (!c)
        return;
    Reverse(u,v);
    Reverse(u,u+c-1);
    Reverse(u+c,v);
}
int main(void)
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
    #endif
    while (~scanf ("%d",&n))
    {
        init();
        int m;
        scanf ("%d",&m);
        for (int i = 0; i < m; i++)
        {
            char op[10];
            int u,v,c;
            scanf ("%s",op);
            if (strcmp(op,"ADD") == 0)
            {
                scanf ("%d%d%d",&u,&v,&c);
                ADD(u,v,c);
            }
            if (strcmp(op,"REVERSE") == 0)
            {
                scanf ("%d%d",&u,&v);
                Reverse(u,v);
            }
            if (strcmp(op,"REVOLVE") == 0)
            {
                scanf ("%d%d%d",&u,&v,&c);
                revolve(u,v,c);
            }
            if (strcmp(op,"INSERT") == 0)
            {
                scanf ("%d%d",&u,&v);
                Insert(u,v);
            }
            if (strcmp(op,"DELETE") == 0)
            {
                scanf ("%d",&u);
                Delete(u);
            }
            if (strcmp(op,"MIN") == 0)
            {
                scanf ("%d%d",&u,&v);
                printf("%d
",query(u,v));
            }
        }
    }
    return 0;
}