P3391 【模板】文艺平衡树 【Splay】

传送门
您需要写一种数据结构（可参考题目标题），来维护一个有序数列。
其中需要提供以下操作：翻转一个区间，例如原有序序列是 [5 4 3 2 1]，翻转区间是 [2,4] 的话，结果是 [5 2 3 4 1]。

分析

一道经典 $Splay$ 模板题
这里介绍一下经常使用的 $Splay$ 相关代码和思想

树的节点

struct Tr {
	#define ls son[0]
	#define rs son[1]
	int k, sz, fa, rev;
	int son[2];
}tr[MAX_N];

更新

void push_up(int rt) {
	tr[rt].sz = tr[tr[rt].ls].sz + tr[tr[rt].rs].sz + 1;
}

标记下放

// 下放旋转标记
void push_rev(int rt) {
	swap(tr[rt].ls, tr[rt].rs);
	tr[rt].rev ^= 1;
}
// 下放所有标记(这里演示，下放旋转标记)
void push_down(int rt) {
	if (!tr[rt].rev) return;
	if (!tr[rt].ls) push_rev(tr[rt].ls);
	if (!tr[rt].rs) push_rev(tr[rt].rs);
	tr[rt].rev ^= 1;
}

判断当前节点为父亲的哪个儿子

bool which(int x) {
	return tr[tr[x].fa].son[1] == x;
}

两种旋转（左右旋转）

void rotate(int x) {
	int p = tr[x].fa;
	int q = tr[p].fa;
	int side = which(x);
	if (q) tr[q].son[which(p)] = x;
	tr[tr[p].son[side] = tr[x].son[side^1]].fa = p;
	tr[tr[x].son[side^1] = p].fa = x;
	tr[x].fa = q;
	push_up(p); push_up(x);
}

三种旋转（旋转到某节点子树上）

void splay(int x, int tar) {
	for (int p; (p = tr[x].fa) != tar; rotate(x)) {
		if (tr[p].fa != tar) rotate(which(x) == which(p) ? p : x);
	}
	if (!tar) root = x;
}

所以总共$6$种旋转

代码

//P3391 
/*
  @Author: YooQ
*/
#include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define ll long long
#define FILE_OUT freopen("out", "w", stdout);
#define FILE_IN freopen("in", "r", stdin);
#define debug(x) cout << #x << ": " << x << "\n";
#define AC 0
#define WA 1
#define INF 0x3f3f3f3f
const ll MAX_N = 1e5+5;
const ll MOD = 1e9+7;
int N, M, K;

int arr[MAX_N];
struct Tr {
	#define l son[0]
	#define r son[1]
	int k, sz, fa, lazy;
	int son[2];
}tr[MAX_N];
int root;

inline void push_up(int rt) {
	tr[rt].sz = tr[tr[rt].l].sz + tr[tr[rt].r].sz + 1;
}

inline void push_down(int rt) {
	if (!tr[rt].lazy) return;
	tr[tr[rt].l].lazy ^= 1;
	tr[tr[rt].r].lazy ^= 1;
	swap(tr[rt].l, tr[rt].r);
	tr[rt].lazy = 0;
}

inline int which(int rt) {
	return tr[tr[rt].fa].son[1] == rt;
}

inline void rotate(int x) {
	int p = tr[x].fa;
	int q = tr[p].fa;
	int side = which(x);
	
	tr[tr[p].son[side] = tr[x].son[side^1]].fa = p;
	tr[tr[x].son[side^1] = p].fa = x;
	tr[x].fa = q;
	
	if (q) {
		tr[q].son[tr[q].son[1] == p] = x;
	}
	
	push_up(p);
	push_up(x);
}

inline void splay(int x, int tar) {
	for (int p; (p = tr[x].fa) != tar; rotate(x)) {
		if (tr[p].fa != tar) rotate(which(x) == which(p) ? p : x);
	}
	if (!tar) root = x;
}

inline int find(int x) {
	int rt = root;
	for (;;) {
		push_down(rt);
		if (tr[rt].l && x <= tr[tr[rt].l].sz) {
			rt = tr[rt].l;
		} else {
			int cnt = (tr[rt].l ? tr[tr[rt].l].sz : 0) + 1;
			if (x == cnt) return rt;
			x -= cnt;
			rt = tr[rt].r;
		}
	}
}

inline int build(int l, int r, int from) {
	int rt = l + ((r-l)>>1);
	tr[rt].fa = from;
	tr[rt].k = arr[rt];
	if (l < rt) tr[rt].l = build(l, rt-1, rt);
	if (r > rt) tr[rt].r = build(rt+1, r, rt);
	push_up(rt);
	return rt;
}

int stk[MAX_N];
int tt = 0;

inline void print(int rt) {
	push_down(rt); 
	if (tr[rt].l) print(tr[rt].l);
	stk[++tt] = tr[rt].k;
	if (tr[rt].r) print(tr[rt].r);
}

void solve(){
	sc("%d%d", &N, &M);
	
	for (int i = 1; i <= N+2; ++i) {
		arr[i] = i - 1;
	}
	
	root = build(1, N+2, 0);

	int l, r;
	for (int i = 1; i <= M; ++i) {
		sc("%d%d", &l, &r);
		l = find(l);
		r = find(r+2);
		
		splay(l, 0);
		splay(r, l);
		
		tr[tr[tr[root].r].l].lazy ^= 1;
	}
	
	print(root);
	
	for (int i = 1; i <= N; ++i) {
		pr("%d ", stk[i+1]);
	}
}

signed main()
{
	#ifndef ONLINE_JUDGE
	//FILE_IN
	FILE_OUT
	#endif
	int T = 1;//cin >> T;
	while (T--) solve();

	return AC;
}