AcWing 798. 差分矩阵
原题链接
简单
作者:
I+III
,
2021-05-29 11:00:00
,
所有人可见
,
阅读 156
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int a[N][N], b[N][N];
int n, m, q;
void insert(int x1, int y1, int x2, int y2, int c){
b[x1][y1] += c;
b[x2+1][y1] -= c;
b[x1][y2+1] -= c;
b[x2+1][y2+1] += c;
}
int main(){
cin>>n>>m>>q;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin>>a[i][j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
insert(i, j, i, j, a[i][j]);
}
}
while(q--){
int x1, y1, x2, y2, c;
cin>>x1>>y1>>x2>>y2>>c;
insert(x1, y1, x2, y2, c);
}
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];
cout<<b[i][j]<<" ";
}
cout<<endl;
}
return 0;
}