差分矩阵 C++实现

#include<iostream>

using namespace std;

const int N=1010;

int a[N][N],s[N][N];

int n,m,q;

void insert(int x1,int y1,int x2,int y2,int c){

s[x1-1][y1-1] += c;

s[x1-1][y2] -= c;

s[x2][y1-1] -=c;

s[x2][y2] += c;

}

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]);

insert(i,j,i,j,a[i][j]);

}

}

while(q--){

int x1,y1,x2,y2,c;

scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&c);

insert(x1,y1,x2,y2,c);

}

for(int i=0;i<n;i++){

for(int j=0;j<m;j++){

s[i][j] += s[i-1][j] + s[i][j-1] -s[i-1][j-1];

printf("%d ",s[i][j]);

}

puts("");

}

}