树状数组

单点修改，区间查询

int t[1000005], n, m;
void add(int x, int v) {
    for (; x <= n; x += x & -x) {
        t[x] += v;
    }
}
int ask(int x) {
    int res = 0;
    for (; x > 0; x -= x & -x) {
        res += t[x];
    }
    return res;
}

区间修改，区间查询

int d[1000005], t1[1000005], t2[1000005], n, m;
void add(int x, int v) {
    for (int i = x; i <= n; i += i & -i) {
        t1[i] += v;
        t2[i] += v * (x - 1);
    }
}
void init() { // 数组d下标从1开始
    for (int i = 1; i <= n; i++) {
        add(i, d[i] - d[i - 1]);
    }
}
int ask(int x) {
    int res = 0;
    for (int i = x; i > 0; i -= i & -i) {
        res += x * t1[i] - t2[i];
    }
    return res;
}
void add_range(int l, int r, int v) {
    add(l, v);
    add(r + 1, -v);
}
int ask_range(int l, int r) {
    return ask(r) - ask(l - 1);
}

二维树状数组：单点修改，区间查询

#include <bits/stdc++.h>
#define int long long
using namespace std;
int t[1 << 13][1 << 13], n, m, op;
void add(int x, int y, int v) {
    for (; x <= n; x += x & -x) {
        for (int j = y; j <= m; j += j & -j) {
            t[x][j] += v;
        }
    }
}
int ask(int x, int y) {
    int sum = 0;
    for (; x; x -= x & -x) {
        for (int j = y; j; j -= j & -j) {
            sum += t[x][j];
        }
    }
    return sum;
}
int get_range(int x1, int y1, int x2, int y2) {
    return ask(x2, y2) + ask(x1 - 1, y1 - 1) - ask(x1 - 1, y2) - ask(x2, y1 - 1);
}
signed main() {
    cin >> n >> m;
    while (cin >> op) {
        if (op == 1) {
            int x, y, v;
            cin >> x >> y >> v;
            add(x, y, v);
        } else {
            int x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            cout << get_range(x1, y1, x2, y2) << endl;
        }
    }
    return 0;
}

二维树状数组：区间修改，区间查询

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 5001;
int t1[MAX][MAX], t2[MAX][MAX], t3[MAX][MAX], t4[MAX][MAX];
int n, m;
void add(int a, int b, int k) {
    for (int i = a; i <= n; i += i & -i) {
        for (int j = b; j <= m; j += j & -j) {
            t1[i][j] += k;
            t2[i][j] += k * a;
            t3[i][j] += k * b;
            t4[i][j] += k * a * b;
        }
    }
}
int sum(int a, int b) {
    int ans = 0;
    for (int i = a; i > 0; i -= i & -i) {
        for (int j = b; j > 0; j -= j & -j) {
            ans += t1[i][j] * ((a + 1) * (b + 1)) - t2[i][j] * (b + 1) - t3[i][j] * (a + 1) + t4[i][j];
        }
    }
    return ans;
}
void range_add(int a, int b, int c, int d, int k) {
    add(a, b, k);
    add(c + 1, d + 1, k);
    add(a, d + 1, -k);
    add(c + 1, b, -k);
}
int range_sum(int a, int b, int c, int d) {
    return sum(a - 1, b - 1) + sum(c, d) - sum(a - 1, d) - sum(c, b - 1);
}
signed main() {
    cin >> n >> m;
    int op, a, b, c, d, k;
    while (cin >> op) {
        if (op == 1) {
            cin >> a >> b >> c >> d >> k;
            range_add(a, b, c, d, k);
        } else {
            cin >> a >> b >> c >> d;
            cout << range_sum(a, b, c, d) << endl;
        }
    }
    return 0;
}