题目链接:点击这里
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1010;
int n, m, q;
int a[N][N], f[N][N];
void insert(int x1, int y1, int x2, int y2, int c)
{
f[x1][y1] += c;
f[x2+1][y1] -= c;
f[x1][y2+1] -= c;
f[x2+1][y2+1] += 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]);
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;
scanf("%d%d%d%d%d", &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)
f[i][j] += f[i-1][j] + f[i][j-1] - f[i-1][j-1];
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
printf("%d ", f[i][j]);
puts("");
}
return 0;
}