差分矩阵

其实只要在自己脑袋里构造一个前缀和矩阵就哦了，没毛病

C++ 代码

#include <iostream>
using namespace std;

int n,m,q;

const int N = 1010;

int a[N][N],b[N][N];


int main(){
    scanf("%d%d%d",&n,&m,&q);
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            scanf("%d",&a[i][j]);
        }
    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            b[i][j] = a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1];
        }
    }
    while(q--){
        int x1,y1,x2,y2,c;
        scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&c);
        b[x1][y1] += c;
        b[x2 + 1][y1] -=c;
        b[x1][y2 + 1] -=c;
        b[x2 + 1][y2 + 1] += c;
    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            a[i][j] = a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1] + b[i][j];
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
    return 0;
}