差分数组的作用就是求多次进行区间修改后的数组。构造出差分数组,就可以快速进行区间增减了。花费O(1)的时间修改 diff 数组,就相当于给原数组的整个区间做了修改。
一维差分:
//给区间[l, r]中的每个数加上c:B[l] += c, B[r + 1] -= c
int m,n;
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]);
//插入的方式形成b[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];
二维差分:
//给以(x1, y1)为左上角,(x2, y2)为右下角的子矩阵中的所有元素加上c:
//S[x1, y1] += c, S[x2 + 1, y1] -= c, S[x1, y2 + 1] -= c, S[x2 + 1, y2 + 1] += c
const int N =1010;
int a[N][N],b[N][N];
int n, m ,q;
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, &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, x2, y1, 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];
}