题解 | 【模板】二维差分

#include <bits/stdc++.h>
using namespace std;
long long arr[10086][10086];
long long dif[10086][10086];
int main()
{
    int n, m, p;
    scanf("%d%d%d", &n, &m, &p);
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            scanf("%lld", &arr[i][j]);
            dif[i][j] = arr[i][j] - arr[i - 1][j] - arr[i][j - 1] + arr[i - 1][j - 1];
        }
    }
    while (p--)
    {
        int x1, y1, x2, y2, k;
        cin >> x1 >> y1 >> x2 >> y2 >> k;
        dif[x1][y1] += k;
        dif[x1][y2 + 1] -= k;
        dif[x2 + 1][y1] -= k;
        dif[x2 + 1][y2 + 1] += k;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            arr[i][j] = arr[i - 1][j] + arr[i][j - 1] - arr[i - 1][j - 1] + dif[i][j];
            printf("%lld ", arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}