数组 a1 a2 ... an 前缀
构造 b1 b2 ... bn 差分
使得 ai = b1 + b2 + ... + bi
即 b1 = a1 b2 = a2 - a1 b3 = a3 - a2 ... bn = an- an-1
an 是 bn 的前缀和, bn 是 an 的差分
// 一维数组差分
// 输入一个数组和执行数 执行 给序列l~r的每个数加上c
#include <iostream>
using namespace std;
const int N = 100010;
int n, m;
int a[N], b[N];
void insert(int l, int r, int c)
{
b[l] += c;
b[r+1] -= c;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i ++) insert(i, i, a[i]);
while(m--)
{
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
insert(l, r, c);
}
for(int i = 1; i <= n; i ++) b[i] += b[i - 1];
for(int i = 1; i <= n; i ++) printf("%d ", b[i]);
return 0;
}
// 二维数组差分
// 输入一个二维数组和执行数 执行 给序列x1 y1 ~ x2 y2的每个数加上c
#include <iostream>
using namespace std;
const int N = 1010;
int n, m, t;
int a[N][N], b[N][N];
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()
{
scanf("%d%d%d", &n, &m, &t);
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(t--)
{
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];
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= m; j ++) cout << b[i][j] << " ";
cout << endl;
}
return 0;
}