P3391 【模板】文艺平衡树（Splay） 数组式

讲解暂无，只是提供一个数组式的splay模板。

#include <cstdio>
#include <algorithm>
using namespace std;

#define isdigit(c) (('0'<=(c))&&((c)<='9'))

inline int geti() {
    int ans = 0; char c = getchar();
    while(!isdigit(c)) c = getchar();
    while( isdigit(c)) ans=ans*10+c-'0', c = getchar();
    return ans;
}

inline void puti(int x) {
    if(x > 9) puti(x / 10);
    putchar('0' + x % 10);
}

const int maxn = 100000 + 10;

int a[maxn];

namespace splay {
    int ch[maxn][2], val[maxn], fa[maxn], rev[maxn], siz[maxn];
    int root, ncnt;
    void maintain(int x) {
        if(x) siz[x] = siz[ch[x][0]] + siz[ch[x][1]] + 1;
    }
    void link(int f, int s, int d) {
        if(s) fa[s] = f;
        if(f) ch[f][d] = s;
    }
    void make(int& x, int l, int r, int f, int d) {
        if(l > r) {x = 0; return;}
        x = ++ ncnt; link(f, x, d);
        if(l == r) {
            ch[x][0] = ch[x][1] = 0;
            val[x] = a[l]; rev[x] = 0; siz[x] = 1;
            return;
        }
        int mid = (l + r)/2;
        make(ch[x][0], l, mid-1, x, 0);
        make(ch[x][1], mid+1, r, x, 1);
        val[x] = a[mid]; rev[x] = 0; maintain(x);
    }
    void insert(int& x, int v, int f) {
        if(x == 0) {
            x = ++ ncnt;
            ch[x][0] = ch[x][1] = 0; val[x] = v;
            fa[x] = f; rev[x] = 0; siz[x] = 1; return;
        }
        insert(ch[x][1], v, x);
        maintain(x);
    }
    void reverse(int x) {
        rev[x] ^= 1;
        swap(ch[x][0], ch[x][1]);
    }
    void pushdown(int x) {
        if(rev[x]) {
            reverse(ch[x][0]);
            reverse(ch[x][1]);
            rev[x] = 0;
        }
    }
    int dir(int x) {
        return x == ch[fa[x]][1];
    }
    void rotate(int x) {
        if(x == root) return;
        int y = fa[x], g = fa[y];
        int d1 = dir(y), d2 = dir(x);
        int s = ch[x][d2 ^ 1];
        link(g, x, d1); link(x, y, d2^1); link(y, s, d2);
        maintain(y);    maintain(x);      maintain(g);
        if(fa[x] == 0) root = x;
    }
    void splay(int x, int f) {
        while(fa[x] != f) {
            int y = fa[x], g = fa[y];
            if(g == f) {
                rotate(x); break;
            }else {
                int d1 = dir(y), d2 = dir(x);
                if(d1 == d2) rotate(y);
                else rotate(x);
                rotate(x);
            }
        }
    }
    void splay(int x, int k, int f) {
        if(x == 0) return;
        pushdown(x);
        if(siz[ch[x][0]]+1 == k) splay(x, f);
        else {
            int d = siz[ch[x][0]]+1 <= k? 1: 0;
            splay(ch[x][d], k - (d? siz[ch[x][0]]+1: 0), f);
        }
    }
    void sreverse(int l, int r) {
        splay(root, l-1, 0);
        splay(root, r+1, root);
        int x = ch[ch[root][1]][0];
        reverse(x);
    }
    void dfs(int x) {
        if(x) {
            pushdown(x);
            dfs(ch[x][0]);
            if(val[x]) puti(val[x]), putchar(' ');
            dfs(ch[x][1]);
        }
    }
}
/// using splay::insert;
using splay::make;
using splay::root;
using splay::sreverse;
using splay::dfs;

int main() {
    int n = geti(), m = geti();
    /// insert(root, 0, 0);
    /// for(int i = 1; i <= n; i ++) insert(root, i, 0);
    /// insert(root, 0, 0);
    for(int i = 2; i <= n+1; i ++) a[i] = i - 1;
    make(root, 1, n+2, 0, 0);
    for(int i = 1; i <= m; i ++) {
        int l = geti(), r = geti();
        sreverse(l+1, r+1);
    }
    dfs(root);
    return 0;
}