主要解决的问题
- 求某一段区间 ± 某一数值
- 给某一二维区间 ± 某一数值
1.一维差分
1.1 算法步骤
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/f2170f0fa9a497ae5bc3d07f9381d2e5.png)
- 求当前数组项与前一项的差值。如上面的差值就是 1,1,1,1,1,1,1
- 在区间 [2,5](2和5分别是所给区间的 [L,R] ) ,这段区间加上 2,就是第二个差值 1处加上2,在到 5 + 1 上减2,(这样在后面求前缀和时候刚好可以抵消)。[2,4] 区间和这里类似
- 在求前缀和,上篇文章有
- 在打印出来
1.2 代码实现
#include <iostream>
using namespace std;
#include <vector>
vector<int> a(10), s(10);
int main()
{
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++)
{
s[i] = a[i] - a[i - 1];
}
while (m--)
{
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
s[l] += c;
s[r + 1] -= c;
}
for (int i = 1; i <= n; i++)
{
s[i] += s[i - 1];
}
for (int i = 1; i <= n; i++)
{
cout << s[i] << " ";
}
return 0;
}
2.二维前缀和
2.1 算法步骤
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/1c770497c44d896bf5bacc048ccad014.png)
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/0a75b545ae0542ee53270e3f8729398e.png)
2.2 代码实现
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int s[N][N],a[N][N];
int main()
{
int n,m,q;
cin >> n>>m>>q;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ )
cin >> s[i][j];
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ )
a[i][j]=s[i][j]+s[i-1][j-1]-s[i][j-1]-s[i-1][j];
while (q -- )
{
int x1,x2,y1,y2,c;
cin >> x1>>y1>>x2>>y2>>c;
a[x1][y1]+=c;
a[x2+1][y2+1]+=c;
a[x1][y2+1]-=c;
a[x2+1][y1]-=c;
}
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
{
s[i][j]=a[i][j]+s[i][j-1]+s[i-1][j]-s[i-1][j-1];
cout << s[i][j]<<" ";
}
cout<<endl;
}
return 0;
}