数据结构分块模板

贴一个优雅的暴力分块模板，原题是洛谷P3374树状数组

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define sz(x) x.size()
#define lbt(x) (x)&(-x)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

typedef pair<int, int> PII;
const int N = 5e5 + 10, mod = 998244353, inf = 0x3f3f3f3f, EPS = 1e-9;

int a[N];

int n, m;
int len, tot, l[N], r[N], belong[N];
int sum[N], b[N];

inline void init() {
    len = sqrt(n), tot = (n + len - 1) / len;
    for (int i = 1;i <= tot;i++)l[i] = r[i - 1] + 1, r[i] = i * len;
    r[tot] = n;
    for (int i = 1;i <= tot;i++) {
        for (int j = l[i];j <= r[i];j++) {
            belong[j] = i;
            sum[i] += a[j];
        }
        b[i] = b[i - 1] + sum[i];
    }
}

inline void modify(int k, int x) {
    sum[belong[k]] += x;a[k] += x;
    for (int i = belong[k];i <= tot;i++) {
        b[i] += x;
    }
}

inline int query(int L, int R) {
    int p = belong[L], q = belong[R];
    int res = 0;
    if (p == q) {
        for (int i = L;i <= R;i++)res += a[i];
        return res;
    }
    res = b[q - 1] - b[p];
    for (int i = L;i <= r[p];i++) res += a[i];
    for (int i = R;i >= l[q];i--)res += a[i];
    return res;
}

void solve() {
    cin >> n >> m;
    for (int i = 1;i <= n;i++)cin >> a[i];
    for (init();m--;) {
        int opt, l, r;
        cin >> opt >> l >> r;
        if (opt == 1)modify(l, r);
        else cout << query(l, r) << endl;
    }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();
    return 0;
}