线段树合并模板

合集 - 模板(41)

1.并查集模板2023-10-312.求质因数模板2023-10-313.二分图最大匹配模板(匈牙利算法)2023-12-024.欧拉函数模板2023-11-305.ST表模板2023-11-266.快速幂模板2023-10-317.字典树模板2023-12-048.矩阵模板2023-12-059.Dijkstra单源最短路模板2023-12-0910.最近公共祖先模板(LCA)2023-12-1211.拓扑排序模板2023-12-1212.区间素数筛模板2023-12-1613.Kruskal和Prim模板2023-12-2414.树状数组模板2023-12-2615.二维坐标离散化模板2024-03-0716.单点修改区间查最值-树状数组模板2024-03-1117.KMP模板2024-03-1118.二叉搜索树模板2024-03-3019.DIjkstra进阶模板 路径记录 按权重(结点数最小等)记录2024-03-3120.判断负环模板2024-04-2821.Exgcd 模板2024-05-0322.压位高精度模板2024-05-0623.线段树模板2024-05-1224.扫描线模板2024-05-1825.莫队模板2024-07-1726.带修莫队模板2024-07-1727.SCC缩点模板2024-07-1828.取模+组合数2024-07-2429.FFT 高精度乘法模板2024-07-2430.字符串自然溢出哈希/单哈希/双哈希模板2024-07-2531.树模板2024-07-2732.dsu on tree 模板2024-07-2833.线段树模板重制2024-08-0334.主席树模板2024-08-0735.大数质因数分解模板2024-08-08

36.线段树合并模板2024-08-09

37.int128输入输出流2024-08-0938.Meissel_Lehmer模板2024-08-0939.浮点高精度2024-08-1340.自适应辛普森法2024-10-0241.unordered_map随机底数种子2024-10-07

收起

template<class Node>
struct PersidentSegmentTree {
#define lc(u) tr[u].l
#define rc(u) tr[u].r
    const int n;
    int tot = 0;
    vector<Node> tr;
    vector<int> root;
 
    PersidentSegmentTree(): n(0) {}
 
    PersidentSegmentTree(int n_): n(n_) {
        int N = (n << 6) + 10;
        tr.reserve(N); root.reserve(N);
        tr.resize(N); root.resize(N);
    }
 
    PersidentSegmentTree(vector<int>& a): PersidentSegmentTree(a.size() - 1) {
        function<void(int&, int, int)> build = [&](int& now, int l, int r) {
            now = ++ tot;
            if (l == r) {
                return ;
            }
            int m = (l + r) >> 1;
            build(lc(now), l, m);
            build(rc(now), m + 1, r);
        };
        build(root[0], 1, n);
    }
 
    //上传
    void pushup(int u) {
        if (tr[lc(u)].Sum >= tr[rc(u)].Sum) {
            tr[u].Sum = tr[lc(u)].Sum;
            tr[u].pos = tr[lc(u)].pos;
        } else {
            tr[u].Sum = tr[rc(u)].Sum;
            tr[u].pos = tr[rc(u)].pos;
        }
    }
 
    //动态开点/更新树结点
    void insert(int& now, int l, int r, int pos, int w) {
        if (!now)
            now = ++ tot;
 
        if (l == r) {
            tr[now].Sum += w;
            tr[now].pos = pos;
            return;
        }
 
        int m = l + r >> 1;
        if (pos <= m)
            insert(lc(now), l, m, pos, w);
        else
            insert(rc(now), m + 1, r, pos, w);
        pushup(now);
    }
 
    //开新前缀树,last代表前缀,now代表新树根
    void insert(int& now, int last, int l, int r, int pos, int w) {
        now = ++ tot;
        tr[now] = tr[last];
        if (l == r) {
            return;
        }
        int m = l + r >> 1;
        if (pos <= m)
            insert(lc(now), lc(last), l, m, pos, w);
        else
            insert(rc(now), rc(last), m + 1, r, pos, w);
    }
 
    //单点
    int query(int now, int l, int r, int pos) {
        if (l == r) {
            return tr[now].Sum;
        }
 
        int m = l + r >> 1;
        if (pos <= m)
            return query(lc(now), l, m, pos);
        else
            return query(rc(now), m + 1, r, pos);
    }
 
    //区间查询 [u,v]->[root[l-1],root[r]]
    int query(int u, int v, int l, int r, int pos) {
        if (l == r) {
            return tr[u].Sum;
        }
 
        int m = l + r >> 1;
        if (pos <= m)
            return query(lc(u), lc(v), l, m, pos);
        else
            return query(rc(u), rc(v), m + 1, r, pos);
    }
 
    void merge(int &u, int v, int l, int r) {
        if (!u || !v) {
            u = u + v;
            return;
        }
 
        if (l == r) {
            tr[u].Sum += tr[v].Sum;
            return ;
        }
 
        int m = l + r >> 1;
        merge(lc(u), lc(v), l, m);
        merge(rc(u), rc(v), m + 1, r);
        pushup(u);
    }
};
 
struct Node {
    int l, r;
    int Sum = 0, pos = 0;
};