题解 | #【模板】二维差分#

#include <iostream>
typedef long long ll;
using namespace std;
ll n, m, q, a[1005][1005],b[1005][1005], x1, y1, x2, y2, k;
int main() {
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%lld", &a[i][j]);
        }
    }
    while (q--) {
        scanf("%lld %lld %lld %lld %lld", &x1, &y1, &x2, &y2, &k);
        b[x1][y1] += k;
        b[x1][y2 + 1] -= k;
        b[x2 + 1][y1] -= k;
        b[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];
            printf("%lld ", a[i][j]+b[i][j]);
        }
        printf("\n");
    }
}

【算法讲解048【必备】二维前缀和、二维差分、离散化技巧】 https://www.bilibili.com/video/BV1Wz4y1K74C/?share_source=copy_web&vd_source=5065fa61022691e8df35c771a30e6d29