[题解]LuoGu1486：[NOI2004]郁闷的出纳员_郁闷的出纳员题解-CSDN博客

本文链接：https://blog.csdn.net/ModestCoder_/article/details/90348321

原题传送门

法1 Splay

四个操作

I k：插入值为k的节点
A k：所有节点+k
S k：所有节点-k
F k：所有节点kth

同时任何时刻，节点值<min时，删除节点

第一眼简直线段树，标记没问题，但是本题需要动态删点，线段树无法完成
需要平衡树

依然标记思想，全局开一个delta变量
加减直接统计到delta里

四个操作可以这样完成：

I k： $i n s e r t (k - d e l t a)$
A k： $d e l t a + = k$
S k： $d e l t a - = k, i n s e r t (M i n - d e l t a),$
$此时根节点左子树全部需要清空（想想为什么）$
F k：因为是第k大，所以需要先把目前总人数算出来， $= r k (i n f) - 2$ ，然后如果总人数<k就输出-1，否则 $k t h (总人数 + 2 - k)$

剩下的就是一些细节问题，比如插入inf和-inf之类的
Code：

#include <bits/stdc++.h>
#define maxn 100010
#define inf 1e9
using namespace std;
int key[maxn], size[maxn], recy[maxn], son[maxn][2], f[maxn];
int n, Min, rt, sz;

inline int read(){
    int s = 0, w = 1;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
    for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
    return s * w;
}

void clear(int x){
    key[x] = f[x] = size[x] = recy[x] = son[x][0] = son[x][1] = 0;
}

int get(int x){ return son[f[x]][1] == x; }

void connect(int x, int y, int z){
    if (x) f[x] = y;
    if (y) son[y][z] = x;
}

void update(int x){
    if (x){
        size[x] = recy[x];
        if (son[x][0]) size[x] += size[son[x][0]];
        if (son[x][1]) size[x] += size[son[x][1]];
    }
}

void rotate(int x){
    int fa = f[x], ffa = f[fa], m = get(x), n = get(fa);
    connect(son[x][m ^ 1], fa, m);
    connect(fa, x, m ^ 1);
    connect(x, ffa, n);
    update(fa); update(x);
}

void splay(int x, int goal){
    while (f[x] != goal){
        int fa = f[x];
        if (f[fa] != goal) rotate(get(x) == get(fa) ? fa : x);
        rotate(x);
    }
    if (!goal) rt = x;
}

void insert(int x){
    if (!rt){
        rt = ++sz;
        key[rt] = x;
        size[rt] = recy[rt] = 1;
        f[rt] = son[rt][0] = son[rt][1] = 0;
        return;
    }
    int now = rt, fa = 0;
    while (1){
        if (key[now] == x){
            ++recy[now];
            update(now); update(fa);
            splay(now, 0);
            return;
        }
        fa = now, now = son[now][x > key[now]];
        if (!now){
            now = ++sz;
            key[now] = x;
            size[now] = recy[now] = 1;
            son[now][0] = son[now][1] = 0;
            f[now] = fa;
            if (fa) son[fa][x > key[fa]] = now;
            update(fa); splay(now, 0);
            return;
        }
    }
}

int id(int x){
    int now = rt;
    while (1){
        if (key[now] == x) return now;
        now = son[now][x > key[now]];
    }
}

int rk(int x){
    int ans = 0, now = rt;
    while (1){
        if (x < key[now]) now = son[now][0]; else{
        	ans += size[son[now][0]];
        	if (x == key[now]){
        		splay(now, 0);
        		return ans + 1;
            }
            ans += recy[now], now = son[now][1];
        }
    }
}

int kth(int x){
    int now = rt;
    while (1){
        if (x <= size[son[now][0]]) now = son[now][0]; else{
            x -= size[son[now][0]];
            if (x <= recy[now]) return key[now];
            x -= recy[now], now = son[now][1];
        }
    }
}

int pre(){
    int now = son[rt][0];
    while (son[now][1]) now = son[now][1];
    return now;
}

void del(int x){
    rk(x);
    if (recy[rt] > 1){
        --recy[rt]; update(rt);
        return;
    }
    if (!son[rt][0] && !son[rt][1]){
        clear(rt); rt = 0; return;
    }
    if (!son[rt][0]){
        int tmp = rt;
        f[rt = son[rt][1]] = 0;
        clear(tmp);
        return;
    }
    if (!son[rt][1]){
        int tmp = rt;
        f[rt = son[rt][0]] = 0;
        clear(tmp);
        return;
    }
    int tmp = rt, left = pre();
    splay(left, 0);
    son[rt][1] = son[tmp][1], f[son[tmp][1]] = rt;
    clear(tmp);
    update(rt);
}

int main(){
    n = read(), Min = read();
    insert(inf); insert(-inf);
    int num = 0, delta = 0;
    while (n--){
        char c = getchar();
        for (; c != 'I' && c != 'A' && c != 'S' && c != 'F'; c = getchar());
        int k = read();
        if (c == 'I'){
            if (k < Min) continue;
            insert(k - delta);
            ++num;
        } else
        if (c == 'A') delta += k; else
        if (c == 'S'){
            delta -= k;
            insert(Min - delta);
            int x = id(-inf), y = id(Min - delta);
            splay(x, 0); splay(y, x);
            son[son[rt][1]][0] = 0;
            del(Min - delta);
        } else{
            int tot = rk(inf) - 2;
            if (tot < k){
                puts("-1"); continue;
            }
            printf("%d\n", kth(tot + 2 - k) + delta);
        }
    }
    printf("%d\n", num - rk(inf) + 2);
    return 0;
}

法2 fhq Treap

跟上面的思路一样，不过平衡树本身操作方便很多~~
操作如下

$I$ $k : s p l i t (r t, k, x, y), r t = m e r g e (m e r g e (x, a d d n o d e (k)), y)$
$A$ $k : d e l t a + = k$
$S$ $k : d e l t a - = k, s p l i t (r t, M i n - d e l t a - 1, x, r t)$
$F$ $k : - - > k t h (r t, s i z e [r t] + 1 - k)$

当然，需要判断加入时有没有小于Min，输出kth时，是不是-1的情况等等

Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
int rt, sz, val[maxn], key[maxn], size[maxn], son[maxn][2];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int addnode(int k){
	++sz;
	val[sz] = k, key[sz] = rand() * rand(), size[sz] = 1;
	return sz;
}

void pushup(int x){ size[x] = size[son[x][0]] + size[son[x][1]] + 1; }

void split(int now, int w, int &u, int &v){
	if (!now) u = v = 0; else{
		if (val[now] <= w) u = now, split(son[now][1], w, son[u][1], v); else
		v = now, split(son[now][0], w, u, son[v][0]);
		pushup(now);
	}
}

int merge(int u, int v){
	if (!u || !v) return u + v;
	if (key[u] >= key[v]){
		son[u][1] = merge(son[u][1], v);
		pushup(u);
		return u;
	} else{
		son[v][0] = merge(u, son[v][0]);
		pushup(v);
		return v;
	}
}

int kth(int now, int k){
	while (1){
		if (size[son[now][0]] >= k) now = son[now][0]; else
		if (size[son[now][0]] + 1 >= k) return now; else
		k -= size[son[now][0]] + 1, now = son[now][1];
	}
}

int main(){
	srand(time(0));
	int M = read(), Min = read(), num = 0, delta = 0, x, y;
	while (M--){
		char c = getchar();
		for (; c != 'I' && c != 'A' && c != 'S' && c != 'F'; c = getchar());
		int k = read();
		if (c == 'I'){
			if (k < Min) continue;
			k -= delta;
			split(rt, k, x, y);
			rt = merge(merge(x, addnode(k)), y);
			++num;
		} else
		if (c == 'A') delta += k; else
		if (c == 'S'){
			delta -= k;
			split(rt, Min - delta - 1, x, rt);
		} else printf("%d\n", k > size[rt] ? -1 : val[kth(rt, size[rt] + 1 - k)] + delta);
	}
	printf("%d\n", num - size[rt]);
	return 0;
}