C++ 代码

// b[i][j] = a[i][j] - sum(b[1...i][1...j])

#include <iostream>
using namespace std;

const int N = 1010;
int b[N][N];

void insert(int x1, int y1, int x2, int y2, int c) {

    b[x1][y1] += c;
    b[x2+1][y2+1] += c;

    b[x2+1][y1] -= c;
    b[x1][y2+1] -= c;
}

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    int tmp;
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            cin >> tmp;
            insert(i, j, i, j, tmp); // 构造差分矩阵
        }
    }
    int x1, y1, x2, y2, c;
    while (q --) {
        cin >> x1 >> y1 >> x2 >> y2 >> c;
        insert(x1, y1, x2, y2, c);
    }

    // 前缀和复原
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {

            b[i][j] += b[i-1][j] + b[i][j-1] - b[i-1][j-1];
            cout << b[i][j] << ' ';
        }
        cout << endl;
    }

    return 0;
}