AcWing 798. 差分矩阵【二维差分】

---

一、题目链接

AcWing 798. 差分矩阵

---

二、题目分析

（一）算法标签

二维差分

（二）解题思路

1. 构建差分数组
借助insert():

   for (int i = 1; i <= n; i ++ ) {
       for (int j = 1; j <= m; j ++ ){
           scanf("%d", &a[i][j]);
           insert(i, j, i, j, a[i][j]);
       }
   }
   

   insert():

   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;
   }
   

2. 由差分数组求原数组
求二维前缀和

   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];
           printf("%d ", b[i][j]);
       }
       printf("\n");
   }
   

---

三、AC代码

解法一:

#include <iostream>

using namespace std;

const int N = 1010;

int n, m, q, x1, y1, x2, y2, c;

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, &q);
    for (int i = 1; i <= n; i ++ ) {
        for (int j = 1; j <= m; j ++ ){
            scanf("%d", &a[i][j]);
            insert(i, j, i, j, a[i][j]);
        }
    }
    while (q --) {
        scanf("%d%d%d%d%d", &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];
            printf("%d ", b[i][j]);
        }
        printf("\n");
    }
    return 0;
}

也可以只开一个差分数组：

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, m, q;
int 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()
{
    cin >> n >> m >> q;
    
    int a;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
        {
            scanf("%d", &a);
            insert(i, j, i, j, a);
        }
    
    while (q -- )
    {
        int x1, y1, x2, y2, c;
        scanf("%d%d%d%d%d", &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];
            printf("%d ", b[i][j]);
        }
        printf("\n");
    }
    return 0;
}

---

四、其它题解

AcWing 798. 差分矩阵