【差分】Acwing798.差分矩阵

Acwing798.差分矩阵

题解

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

const int N = 1e3+10;

int s[N][N];

void insert(int x, int y, int xx, int yy, int c)
{
    s[x][y] += c, s[xx + 1][yy + 1] += c;
    s[xx+1][y] -= c, s[x][yy + 1] -= c;
}

int main()
{
    int n, m, q;
    int xx, yy, x, y, c;
    scanf("%d%d%d",&n, &m, &q);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            scanf("%d",&c), insert(i, j, i, j, c);
    while(q -- )
        scanf("%d%d%d%d%d",&x, &y, &xx, &yy, &c), insert(x, y, xx, yy, c);
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= m; ++j){
            s[i][j] = s[i][j] + s[i-1][j] + s[i][j-1] - s[i-1][j-1];
            printf("%d ",s[i][j]);
        }
        puts("");
    }
    
    return 0;
}