线段树模板

合集 - 模板(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-06

23.线段树模板2024-05-12

24.扫描线模板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-0836.线段树合并模板2024-08-0937.int128输入输出流2024-08-0938.Meissel_Lehmer模板2024-08-0939.浮点高精度2024-08-1340.自适应辛普森法2024-10-0241.unordered_map随机底数种子2024-10-07

收起

#define lc u<<1
#define rc u<<1|1
const int N = 1e5 + 5;
i64 w[N], n, m, p;
struct Tree { //线段树
    i64 l, r, sum, add, mul;
} tr[N * 4];
 
void cal_lazy(i64 fa, i64 ch) {
    i64 a = tr[fa].mul, b = tr[fa].add;
    i64 len = tr[ch].r - tr[ch].l + 1;
    tr[ch].sum = (a * tr[ch].sum % p + len * b % p) % p;
}
 
void tag_union(i64 fa, i64 ch) {
    i64 a = tr[fa].mul, b = tr[fa].add;
    tr[ch].mul = (tr[ch].mul * a) % p;
    tr[ch].add = (tr[ch].add * a % p + b) % p;
}
 
void init_lazy(i64 u) {
    tr[u].add = 0;
    tr[u].mul = 1;
}
 
void pushdown(i64 u) {
    if (tr[u].add != 0 || tr[u].mul != 1) {
        cal_lazy(u, lc);
        cal_lazy(u, rc);
        tag_union(u, lc);
        tag_union(u, rc);
        init_lazy(u);
    }
}
 
void pushup(i64 u) { //上传
    tr[u].sum = (tr[lc].sum + tr[rc].sum) % p;
}
 
void build(i64 u, i64 l, i64 r) { //建树
    tr[u].l = l, tr[u].r = r;
    init_lazy(u);
    if (l == r) {
        tr[u].sum = w[l];
        return ;
    }
    i64 mid = (l + r) >> 1;
    build(lc, l, mid);
    build(rc, mid + 1, r);
    pushup(u);
 
}
 
void modify(i64 u, i64 l, i64 r, i64 k, int type) {
    if (tr[u].l >= l && tr[u].r <= r) {
        if (type == 2) {
            i64 len = tr[u].r - tr[u].l + 1;
            tr[u].sum = (tr[u].sum + k * len % p) % p;
            tr[u].add = (tr[u].add + k) % p;
        } else {
            tr[u].sum = (tr[u].sum * k) % p;
            tr[u].mul = (tr[u].mul * k) % p;
            tr[u].add = (tr[u].add * k) % p;
        }
        return ;
    }
    pushdown(u);
    i64 mid = (tr[u].l + tr[u].r) >> 1;
    if (l <= mid)
        modify(lc, l, r, k, type);
    if (r > mid)
        modify(rc, l, r, k, type);
    pushup(u);
}
 
i64 query(i64 u, i64 l, i64 r) { //区查
    if (l <= tr[u].l && tr[u].r <= r)
        return tr[u].sum;
    i64 mid = tr[u].l + tr[u].r >> 1;
    pushdown(u);
    i64 res = 0;
    if (l <= mid) res += query(lc, l, r), res %= p;
    if (r > mid) res += query(rc, l, r), res %= p;
    return res % p;
}