带修莫队模板

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

26.带修莫队模板2024-07-17

27.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

收起

取分块大小 \(n^\frac{2}{3}\) 最优。
例题：数颜色

#include<bits/stdc++.h>
 
using namespace std;
 
using i64 = long long;
 
const int N = 1e6 + 5;
int cnt[N], a[N];
 
struct query {
    int l, r, t, id;//加入时间戳
};
 
struct modfiy {
    int pos, val;
};
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int n, m;
    cin >> n >> m;
 
    int M = pow(n, 2.0 / 3.0);
 
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
 
    int cntc = 0, cntq = 0;
    vector<query> q;
    vector<modfiy> c;
    for (int i = 0; i < m; i ++) {
        char op;
        int l, r;
        cin >> op >> l >> r;
        if (op == 'Q') {
            int qt = c.size();
            q.push_back({l, r, qt, (int)q.size()});
        } else {
            c.push_back({l, r});
        }
    }
	//排序与普通莫队不同
    sort(q.begin(), q.end(), [&M](query x, query y) {
        return (((x.l / M) ^ (y.l / M)) ? x.l < y.l : ((x.r / M) ^ (y.r / M)) ? x.r < y.r : x.t < y.t);
    });
 
    int l = 1, r = 0, time = 0, now = 0;
    vector<int> ans(q.size());
    for (int i = 0; i < q.size(); i ++) {
        auto [ql, qr, qt, id] = q[i];
 
        while (l < ql)  now -= !--cnt[a[l++]];
        while (l > ql) now += !cnt[a[--l]]++;
        while (r < qr) now += !cnt[a[++r]]++;
        while (r > qr) now -= !--cnt[a[r--]];
 
        while (time < qt) {
            if (ql <= c[time].pos && c[time].pos <= qr)
                now -= !--cnt[a[c[time].pos]] - !cnt[c[time].val]++;
            swap(a[c[time].pos], c[time].val);
            ++time;
        }
        while (time > qt) {
            --time;
            if (ql <= c[time].pos && c[time].pos <= qr)
                now -= !--cnt[a[c[time].pos]] - !cnt[c[time].val]++;
            swap(a[c[time].pos], c[time].val);
        }
        ans[id] = now;
    }
 
    for (int i = 0; i < q.size(); i ++)
        cout << ans[i] << "\n";
 
    return 0;
}