fhq-Treap 学习笔记

fhq-Treap 及非旋Treap, 类似普通的Treap, 每个点有一个val(值), 和rank(随记出来的), 期望树高log

核心操作有如下 Build -> O(n), Split -> O(log), Merge -> O(log)

当然, Build 也可以一个一个插入, 也不是很慢

---

Build

先将树按值排序, 然后一个一个加, 用栈维护最右链, 每次直接加在最右链的右儿子下

如果当前的rank小于父亲, 就在栈中将父亲退掉, 直到合法(满足堆的性质),然后把退掉的子树接到左儿子

int Build(int *a, int n){
    int top = 0, pre = 0, u = 0;
    for(int i=1; i<=n; i++){
        u = new_node(a[i]); pre = 0;
        while(top && t[sta[top]].rank > t[u].rank)
            pre = sta[top], Pushup(sta[top]), sta[top--] = 0;
        if(top) t[sta[top]].rc = u;
        t[u].lc = pre; sta[++top] = u;
    } while(top) Pushup(sta[top--]);
    return sta[1];
}

---

Split

Split(x, k) 指将x为根的子树的前k个与后n-k+1个划开

我们类似找第k大, 边找边割, 然后在合并, 用一个pair存划开后的左右子树

#define pa pair<int,int>
pa split(int x, int k){
    if(!x) return  mp(0, 0);
    pa T; Pushdown(x);
    if(t[ls].siz >= k) T = split(ls, k), ls = T.second, T.second = x;
    else T = split(rs, k - t[ls].siz - 1), rs = T.first, T.first = x;
    Pushup(x); return T;
}

---

Merge

Merge(u, v) 指将以u, v为根的两个子树合并成一棵, 其中u的值全部小于v的值(有顺序), 合并时注意堆的性质

如果u -> rank < v->rank, 那么只有u为根, 然后合并u的左儿子和v(因为v全部大于u, 所以一定在u的左儿子), 反之亦然

int merge(int u, int v){
    if(!u || !v) return u+v;
    if(t[u].rank < t[v].rank){
        Pushdown(u); t[u].rc = merge(t[u].rc, v);
        Pushup(u); return u;
    } else{
        Pushdown(v); t[v].lc = merge(u, t[v].lc);
        Pushup(v); return v;
    }
}

---

其它操作都是基于Merge, Split上的

例如区间翻转[l, r], 那么只需Split(rt, l-1), 将后面那棵树 Split(rt', r-l+1), 然后打上标记即可

Split 完记得 Merge 回去

void Reverse(int l, int r){
	pa t1 = Split(rt, l-1), t2 = Split(t1.second, r - l + 1);
	Pushrev(t2.first); Merge(t1.first, Merge(t2.first, t2.second));
}

例如 在pos后 Insert 长度为cnt 的一串数, 只需Build那些树, 令根为u, 然后Split(rt, pos), 在Merge(first, Merge(u, second))

void Insert(int pos, int cnt){
    for(int i=1; i<=cnt; i++) tmp[i] = read();
    int u = Build(tmp, cnt);
    pa t = split(rt, pos);
    rt = merge(t.first, merge(u, t.second));
}

总之就是通过Split 将区间取出来操作, 再Merge回去

---

模板 P2042 [NOI2005]维护数列

#include<bits/stdc++.h>
#define N 800050
using namespace std;
const int inf = 0x3fffffff;
#define pa pair<int, int>
#define mp make_pair
int read(){
    int cnt = 0, f = 1; char ch = 0;
    while(!isdigit(ch)){ ch = getchar(); if(ch == '-') f = -1;}
    while(isdigit(ch)) cnt = cnt*10 + (ch-'0'), ch = getchar();
    return cnt * f;
}
int Random(){
    static int seed = 233;
    return seed = int(seed*47281LL%2147483647);
}
struct Node{
    int lc, rc, val, rank, siz;
    int mx, lx, rx, sum, cover, rev;
}t[N];
stack<int> S;
int n, m, a[N], rt, tot, tmp[N];
int sta[N];
int new_node(int val){
    int u = 0; if(S.size()) u = S.top(), S.pop(); else u = ++tot;
    t[u] = (Node){0, 0, val, Random(), 1, val, max(val, 0), max(val, 0), val, 223223, 0};
    return u;
}
void recycle(int u){
    if(!u) return; S.push(u); recycle(t[u].lc); recycle(t[u].rc);
}
#define ls t[x].lc
#define rs t[x].rc
#define w t[x].cover
void Pushup(int x){
    if(!x) return;
    t[x].siz = t[ls].siz + t[rs].siz + 1;
    t[x].sum = t[ls].sum + t[rs].sum + t[x].val;
    t[x].mx = max(t[ls].rx + t[x].val + t[rs].lx, max(t[ls].mx, t[rs].mx));
    t[x].lx = max(t[ls].lx, t[ls].sum + t[x].val + t[rs].lx);
    t[x].rx = max(t[rs].rx, t[rs].sum + t[x].val + t[ls].rx);
}
void Pushrev(int x){ if(!x) return; swap(ls, rs); swap(t[x].lx, t[x].rx); t[x].rev ^= 1;}
void Pushcover(int x, int v){ 
    if(!x) return;
    t[x].val = v; t[x].sum = v * t[x].siz; w = v;
    if(v > 0) t[x].mx = t[x].lx = t[x].rx = t[x].sum;
    else t[x].mx = v, t[x].lx = t[x].rx = 0;
}
void Pushdown(int x){
    if(t[x].rev) Pushrev(ls), Pushrev(rs), t[x].rev = 0;
    if(w != 223223) Pushcover(ls, w), Pushcover(rs, w), w = 223223; 
}
int Build(int *a, int n){
    int top = 0, pre = 0, u = 0;
    for(int i=1; i<=n; i++){
        u = new_node(a[i]); pre = 0;
        while(top && t[sta[top]].rank > t[u].rank)
            pre = sta[top], Pushup(sta[top]), sta[top--] = 0;
        if(top) t[sta[top]].rc = u;
        t[u].lc = pre; sta[++top] = u;
    } while(top) Pushup(sta[top--]);
    return sta[1];
}
int merge(int u, int v){
    if(!u || !v) return u+v;
    if(t[u].rank < t[v].rank){
        Pushdown(u); t[u].rc = merge(t[u].rc, v);
        Pushup(u); return u;
    } else{
        Pushdown(v); t[v].lc = merge(u, t[v].lc);
        Pushup(v); return v;
    }
}
pa split(int x, int k){
    if(!x) return  mp(0, 0);
    pa T; Pushdown(x);
    if(t[ls].siz >= k) T = split(ls, k), ls = T.second, T.second = x;
    else T = split(rs, k - t[ls].siz - 1), rs = T.first, T.first = x;
    Pushup(x); return T;
}
void Insert(int pos, int cnt){
    for(int i=1; i<=cnt; i++) tmp[i] = read();
    int u = Build(tmp, cnt);
    pa t = split(rt, pos);
    rt = merge(t.first, merge(u, t.second));
}
void Delete(int pos, int cnt){
    pa t1 = split(rt, pos-1), t2 = split(t1.second, cnt);
    recycle(t2.first); rt = merge(t1.first, t2.second);
}
void Cover(int pos, int cnt, int v){
    pa t1 = split(rt, pos-1), t2 = split(t1.second, cnt);
    Pushcover(t2.first, v); rt = merge(t1.first, merge(t2.first, t2.second));
}
void Reverse(int pos, int cnt){
    pa t1 = split(rt, pos-1), t2 = split(t1.second, cnt);
    Pushrev(t2.first); rt = merge(t1.first, merge(t2.first, t2.second));
}
int Getsum(int pos, int cnt){
    pa t1 = split(rt, pos-1), t2 = split(t1.second, cnt);
    printf("%d\n", t[t2.first].sum);
    rt = merge(t1.first, merge(t2.first, t2.second));
}
int Maxsum(){ printf("%d\n", t[rt].mx);} 
int main(){
	t[0].mx = -1e9; 
    n = read(), m = read(); 
    for(int i=1; i<=n; i++) a[i] = read();
    rt = Build(a, n);
    while(m--){
        char s[15]; scanf("%s", s);
        if(s[0] == 'I'){ int pos = read(), cnt = read(); Insert(pos, cnt);}
        if(s[0] == 'D'){ int pos = read(), cnt = read(); Delete(pos, cnt);}
        if(s[0] == 'M' && s[2] == 'K'){ int pos = read(), cnt = read(), v = read(); Cover(pos, cnt, v);}
        if(s[0] == 'R'){ int pos = read(), cnt = read(); Reverse(pos, cnt);}
        if(s[0] == 'G'){ int pos = read(), cnt = read(); Getsum(pos, cnt);}
        if(s[0] == 'M' && s[2] == 'X') Maxsum();
    } return 0;
}