题解 | 【模板】二维差分

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<long long>> b(n + 2, vector<long long> (m + 2));
    vector<vector<long long>> d(n + 2, vector<long long>(m + 2));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> b[i][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            d[i][j] = b[i][j] - b[i - 1][j] - b[i][j - 1] + b[i - 1][j - 1];
        }
    }

    while (q--) {
        int x1, y1, x2, y2, k;
        cin >> x1 >> y1 >> x2 >> y2 >> k;
        d[x1][y1] += k;
        d[x2+1][y1]-=k;
        d[x1][y2+1]-=k;
        d[x2+1][y2+1]+=k;
    }
    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]+d[i][j];
        }
    }
    for(int i = 1;i<=n;i++) {
        for(int j=1;j<=m;j++) {
            cout << b[i][j] << " ";
            
        }
        cout << endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")