原题链接:https://www.acwing.com/problem/content/800/
题目分析
二维差分数组的模板题 ~
要实现的就是二维差分数组最常见的操作——子矩阵每一个元素加C
(这种思想在树状数组中也会用到)
差分数组详解
“差分”与“前缀和” 互为逆运算 ,若sum[]是a[]的前缀和数组,则a[]就是sum[]的差分数组。
相关题目:
一维前缀和:https://blog.csdn.net/boomgloom/article/details/136921697?spm=1001.2014.3001.5501
二维前缀和:
https://blog.csdn.net/boomgloom/article/details/136923507?spm=1001.2014.3001.5501
核心操作
给(x1,y1)到(x2,y2)的子矩阵所有元素加上C.。
//a为差分数组
a[x1][y1] += c;
a[x2 + 1][y2 + 1] += c;
a[x2 + 1][y1] -= c;
a[x1][y2 + 1] -= c;
创建方式
与核心操作的代码几乎一模一样,唯一的不同就在于把子矩阵大小从(x1,y1)到(x2,y2)变成了单位1(一个元素),这样我们在输入原数组同时就实现了差分数组的初始化~
a[i][j] += x;
a[i + 1][j] -= x;
a[i][j + 1] -= x;
a[i + 1][j + 1] += x;
c++代码
输入时将原数组转化成差分数组,直接在其上进行差分操作,最后求前缀和得到处理后的原数组
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int inf = 0x3f3f3f;
int n, m, q;
int a[N][N];
int main()
{
scanf("%d%d%d", &n, &m, &q);
//直接将a变成差分数组
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ )
{
int x;
scanf("%d", &x);
a[i][j] += x;
a[i + 1][j] -= x;
a[i][j + 1] -= x;
a[i + 1][j + 1] += x;
}
//q次操作
while (q -- )
{
int x1, y1, x2, y2, c;
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &c);
a[x1][y1] += c;
a[x2 + 1][y1] -= c;
a[x1][y2 + 1] -= c;
a[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];
//输出a[][]
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
printf("%d ", a[i][j]);
puts("");
}
return 0;
}