【POJ】3580 SuperMemo

#include<cstdio>
#include<cstring>
#include<algorithm>
#define oo 0x7FFFFFFF
#define MAXN 200010
using namespace std;
struct SplayTree {
    int size, root, top;
    int st[MAXN], a[MAXN];
    int next[MAXN][2], pre[MAXN], key[MAXN], num[MAXN];
    int add[MAXN], mini[MAXN];
    bool flip[MAXN];
    inline void PushUp(int x) {
        num[x] = num[next[x][0]] + num[next[x][1]] + 1;
        mini[x] = min(mini[next[x][0]], mini[next[x][1]]);
        mini[x] = min(mini[x], key[x]);
    }
    inline void PushDown(int x) {
        int L, R;
        L = next[x][0];
        R = next[x][1];
        if (add[x]) {
            if (L) {
                add[L] += add[x];
                key[L] += add[x];
                mini[L] += add[x];
            }
            if (R) {
                add[R] += add[x];
                key[R] += add[x];
                mini[R] += add[x];
            }
            add[x] = 0;
        }
        if (flip[x]) {
            flip[L] ^= true;
            flip[R] ^= true;
            swap(next[x][0], next[x][1]);
            flip[x] = false;
        }
    }
    void NewNode(int &x, int father, int val) {
        if (top != -1)
            x = st[top--];
        else
            x = ++size;
        next[x][0] = next[x][1] = add[x] = 0;
        pre[x] = father;
        key[x] = mini[x] = val;
        num[x] = 1;
        flip[x] = false;
    }
    void Build(int &x, int L, int R, int father) {
        if (L <= R) {
            int mid = (L + R) >> 1;
            NewNode(x, father, a[mid]);
            Build(next[x][0], L, mid - 1, x);
            Build(next[x][1], mid + 1, R, x);
            PushUp(x);
        }
    }
    void Init(int n) {
        root = size = 0;
        top = -1;
        flip[0] = false;
        next[0][0] = next[0][1] = pre[0] = num[0] = add[0] = 0;
        key[0] = mini[0] = oo;
        NewNode(root, 0, oo);
        NewNode(next[root][1], root, oo);
        Build(next[next[root][1]][0], 1, n, next[root][1]);
        PushUp(next[root][1]);
        PushUp(root);
    }
    void Rotate(int x, int kind) {
        int y, z;
        y = pre[x];
        z = pre[y];
        PushDown(y);
        next[y][!kind] = next[x][kind];
        pre[next[x][kind]] = y;
        next[z][next[z][1] == y] = x;
        pre[x] = z;
        next[x][kind] = y;
        pre[y] = x;
        PushUp(y);
    }
    void Splay(int x, int goal) {
        if (x != goal) {
            PushDown(x);
            while (pre[x] != goal) {
                if (next[pre[x]][0] == x)
                    Rotate(x, 1);
                else
                    Rotate(x, 0);
            }
            PushUp(x);
            if (!goal)
                root = x;
        }
    }
    int Select(int k) {
        int x;
        PushDown(root);
        for (x = root; num[next[x][0]] + 1 != k;) {
            if (num[next[x][0]] + 1 > k)
                x = next[x][0];
            else {
                k -= num[next[x][0]] + 1;
                x = next[x][1];
            }
            PushDown(x);
        }
        return x;
    }
    void Add(int x, int y, int val) {
        int t;
        x = Select(x - 1);
        y = Select(y + 1);
        Splay(x, 0);
        Splay(y, x);
        t = next[y][0];
        add[t] += val;
        key[t] += val;
        mini[t] += val;
        PushUp(y);
        PushUp(x);
    }
    void Flip(int x, int y) {
        x = Select(x - 1);
        y = Select(y + 1);
        Splay(x, 0);
        Splay(y, x);
        flip[next[y][0]] ^= true;
    }
    void Revolve(int x, int y, int t) {
        int cnt = y - x + 1;
        t %= cnt;
        if (t < 0)
            t += cnt;
        if (t) {
            Flip(x, y - t);
            Flip(y - t + 1, y);
            Flip(x, y);
        }
    }
    void Insert(int x, int val) {
        int a, b;
        a = Select(x);
        b = Select(x + 1);
        Splay(a, 0);
        Splay(b, a);
        NewNode(next[b][0], b, val);
        PushUp(b);
        PushUp(a);
    }
    void Delete(int x) {
        int a, b;
        a = Select(x - 1);
        b = Select(x + 1);
        Splay(a, 0);
        Splay(b, a);
        st[++top] = next[b][0];
        next[b][0] = 0;
        PushUp(b);
        PushUp(a);
    }
    int MIN(int x, int y) {
        x = Select(x - 1);
        y = Select(y + 1);
        Splay(x, 0);
        Splay(y, x);
        return mini[next[y][0]];
    }
} spt;
int main() {
    char cmd[18];
    int n, q, i;
    int x, y, val;
    while (~scanf("%d", &n)) {
        for (i = 1; i <= n; i++)
            scanf("%d", &spt.a[i]);
        spt.Init(n);
        scanf("%d", &q);
        while (q--) {
            scanf(" %s", cmd);
            if (strcmp(cmd, "ADD") == 0) {
                scanf("%d%d%d", &x, &y, &val);
                spt.Add(x + 1, y + 1, val);
            } else if (strcmp(cmd, "REVERSE") == 0) {
                scanf("%d%d", &x, &y);
                spt.Flip(x + 1, y + 1);
            } else if (strcmp(cmd, "REVOLVE") == 0) {
                scanf("%d%d%d", &x, &y, &val);
                spt.Revolve(x + 1, y + 1, val);
            } else if (strcmp(cmd, "INSERT") == 0) {
                scanf("%d%d", &x, &val);
                spt.Insert(x + 1, val);
            } else if (strcmp(cmd, "DELETE") == 0) {
                scanf("%d", &x);
                spt.Delete(x + 1);
            } else {
                scanf("%d%d", &x, &y);
                printf("%d\n", spt.MIN(x + 1, y + 1));
            }
        }
    }
    return 0;
}