题目:
题解:
这个类似于反向的前缀和:
黑色地方全部加n,就是:
整个-红色-绿色+蓝色
s[x1][y1] += x;
s[x2 + 1][y1] -= x;
s[x1][y2 + 1] -= x;
s[x2 + 1][y2 + 1] += x;
然后每个位置的结果就是前缀和:
s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
代码:
#include<iostream>
using namespace std;
const int N = 10010;
int s[N][N], sum[N][N] = {0};
int n, m, k;
void insert(int x1, int y1, int x2,int y2,int x)
{
s[x1][y1] += x;
s[x2 + 1][y1] -= x;
s[x1][y2 + 1] -= x;
s[x2 + 1][y2 + 1] += x;
}
int main()
{
scanf_s("%d%d%d", &m, &n, &k);
int x;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
scanf_s("%d", &x);
insert(i, j, i, j, x);
}
}
while (k--)
{
int x1, y1, x2, y2, x;
scanf_s("%d%d%d%d%d", &x1, &y1, &x2, &y2, &x);
insert(x1, y1, x2, y2, x);
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
}
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
printf("%d ", s[i][j]);
cout << endl;
}
system("pause");
}