POJ 3580：SuperMemo（Splay）

http://poj.org/problem?id=3580

题意：有6种操作，其中有两种之前没做过，就是Revolve操作和Min操作。Revolve一开始想着一个一个删一个一个插，觉得太暴力了，后来发现可以把要放到前面的一段切开，丢到前面去，就和上一题的Cut是一样的了。还有Min操作，一开始特别ZZ地想着只要找keytree的最左边就好了，然后发现并不是那样的，要维护一个 mi 值，一开始两个节点设成 INF，然后 pushup 的时候先把 val 赋给 mi，然后再和左右儿子对比。WA了好几次，找了下数据。。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iostream>
#include <stack>
#include <map>
#include <queue>
using namespace std;
#define N 1000100
#define INF 0x7fffffff
#define lson ch[x][0]
#define rson ch[x][1]
#define keytree ch[ch[root][1]][0]

struct SplayTree
{
    int num[N], rev[N], ch[N][2], fa[N], val[N], sz[N], col[N], mi[N];
    int n, root, cnt;

    void PushDown(int x)
    {
        if(rev[x]) {
            swap(lson, rson);
            if(lson) rev[lson] ^= 1;
            if(rson) rev[rson] ^= 1;
            rev[x] = 0;
        }
        if(col[x]) {
            if(lson) {
                col[lson] += col[x];
                val[lson] += col[x];
                mi[lson] += col[x];
            }
            if(rson) {
                col[rson] += col[x];
                val[rson] += col[x];
                mi[rson] += col[x];
            }
            col[x] = 0;
        }
    }

    void PushUp(int x)
    {
        sz[x] = sz[lson] + sz[rson] + 1;
        mi[x] = val[x];
        if(lson) mi[x] = min(mi[x], mi[lson]);
        if(rson) mi[x] = min(mi[x], mi[rson]);
    }

    int NewNode(int w, int f, int kind)
    {
        int x = ++cnt;
        ch[x][0] = ch[x][1] = rev[x] = col[x] = 0;
        sz[x] = 1; val[x] = w; fa[x] = f;
        mi[x] = w;
        ch[f][kind] = cnt;
        return x;
    }

    void Build(int l, int r, int &x, int f, int kind)
    {
        if(l > r) return ;
        int m = (l + r) >> 1;
        x = NewNode(num[m], f, kind);
        Build(l, m - 1, ch[x][0], x, 0);
        Build(m + 1, r, ch[x][1], x, 1);
        PushUp(x);
    }

    void Init()
    {
        root = cnt = 0;
        rev[0] = val[0] = col[0] = fa[0] = sz[0] = ch[0][0] = ch[0][1] = 0;
        mi[0] = INF;
        root = NewNode(INF, 0, 0);
        ch[root][1] = NewNode(INF, root, 1);
        val[ch[root][1]] = INF;
        sz[root] = 2;
        Build(1, n, keytree, ch[root][1], 0);
        PushUp(ch[root][1]); PushUp(root);
    }

    void Rotate(int x, int kind)
    {
        int y = fa[x], z = fa[y];
        PushDown(y); PushDown(x);
        ch[y][!kind] = ch[x][kind];
        if(ch[y][!kind]) fa[ch[y][!kind]] = y;
        if(z) {
            if(y == ch[z][0]) ch[z][0] = x;
            else ch[z][1] = x;
        }
        fa[x] = z; fa[y] = x;
        ch[x][kind] = y;
        PushUp(y);
    }

    void Splay(int x, int goal)
    {
//        printf("%d, %d
", x, fa[x]);
        PushDown(x);
        while(fa[x] != goal) {
            int y = fa[x], z = fa[y];
            PushDown(z); PushDown(y); PushDown(x);
            int kind1 = x == ch[y][0];
            int kind2 = y == ch[z][0];
            if(z == goal) {
                Rotate(x, kind1);
            } else {
                if(kind1 == kind2) {
                    Rotate(y, kind1);
                } else {
                    Rotate(x, kind1);
                }
                Rotate(x, kind2);
            }
        }
        PushUp(x);
        if(goal == 0) root = x;
    }

    void RTO(int k, int goal)
    {
        int x = root;
        PushDown(x);
        while(k != sz[lson] + 1) {
            if(k <= sz[lson]) x = lson;
            else k -= sz[lson] + 1, x = rson;
            PushDown(x);
        }
//        printf("%d, %d, %d
", x, val[x], goal);
        Splay(x, goal);
    }

    void Add(int l, int r, int d)
    {
        RTO(l, 0); RTO(r + 2, root);
        col[keytree] += d;
        val[keytree] += d;
        mi[keytree] += d;
        PushUp(ch[root][1]); PushUp(root);
    }

    void Reverse(int l, int r)
    {
        RTO(l, 0); RTO(r + 2, root);
        rev[keytree] ^= 1;
        PushUp(ch[root][1]); PushUp(root);
    }

    void Cut(int l, int r, int c)
    {
        RTO(l, 0); RTO(r + 2, root);
        PushUp(ch[root][1]); PushUp(root);
//      Debug();
//      puts("---------");
        int tmp = keytree;
        keytree = 0;
        RTO(c, 0); RTO(c + 1, root);
        keytree = tmp;
        fa[tmp] = ch[root][1];
        PushUp(ch[root][1]); PushUp(root);
    }

    void Revolve(int l, int r, int t)
    {
        t = (t % (r - l + 1) + (r - l + 1)) % (r - l + 1);
        if(t == 0) return ;
        Cut(r - t + 1, r, l);
//        Debug();
        PushUp(ch[root][1]); PushUp(root);
    }

    void Insert(int index, int w)
    {
        RTO(index + 1, 0); RTO(index + 2, root);
        keytree = NewNode(w, ch[root][1], 0);
        PushUp(ch[root][1]); PushUp(root);
    }

    void Delete(int index)
    {
        RTO(index, 0); RTO(index + 2, root);
        keytree = 0;
        PushUp(ch[root][1]); PushUp(root);
    }

    int Query(int l, int r)
    {
        RTO(l, 0);
        RTO(r + 2, root);
//        Debug();
        return mi[keytree];
    }

    void Travel(int x)
    {
        if(lson) Travel(lson);
        printf("ttt : %d, %d, %d
", x, val[x], mi[x]);
        if(rson) Travel(rson);
    }

    void Debug()
    {
        Travel(root);
    }
}spy;

int main()
{
    int n;
    while(~scanf("%d", &n)) {
        spy.n = n;
        for(int i = 1; i <= n; i++) scanf("%d", &spy.num[i]);
        spy.Init();
        int m;
        scanf("%d", &m);
        while(m--) {
            char s[10];
            int a, b, c;
            scanf("%s", s);
            if(s[0] == 'A') {
                scanf("%d%d%d", &a, &b, &c);
                spy.Add(a, b, c);
            } else if(s[0] == 'M') {
                scanf("%d%d", &a, &b);
                printf("%d
", spy.Query(a, b));
            } else if(s[0] == 'R' && s[3] == 'E') {
                scanf("%d%d", &a, &b);
                spy.Reverse(a, b);
            } else if(s[0] == 'R' && s[3] == 'O') {
                scanf("%d%d%d", &a, &b, &c);
                spy.Revolve(a, b, c);
            } else if(s[0] == 'I') {
                scanf("%d%d", &a, &b);
                spy.Insert(a, b);
            } else if(s[0] == 'D') {
                scanf("%d", &a);
                spy.Delete(a);
            }
//            spy.Debug();
        }
    }
    return 0;
}

/*
5
1
2
3
4
5
2
REVOLVE 1 5 4
MIN 4 5

10
1 2 3 4 5 6 7 8 9 10
15
ADD 4 8 3
MIN 5 7
MIN 7 10
REVERSE 2 5
MIN 2 6
MIN 2 3
INSERT 3 4
MIN 3 4
MIN 5 10
DELETE 6
MIN 3 5
MIN 4 4
REVOLVE 3 6 7
MIN 5 8
MIN 7 10
＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊＊
８
９
２
７
４
２
３
４
７
９
*/