基础算法——二维差分

insert函数思想：

模板：

#include<bits/stdc++.h>

using namespace std;

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(){
    cin >> n >> m >> q;
    for(int i = 1;i <= n;i ++ ){
        for(int j = 1;j <= m;j ++ ){
            cin >> 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,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;
}

对差分和前缀和的模板总结：

一维前缀和的构造：

for(int i = 1;i <= n;i ++ ){
        s[i] = s[i - 1] + a[i];
    }

一维差分insert函数：

void insert(int l,int r,int c){
    b[l] += c;
    b[r + 1] -= c;
}

差分数组b的初始化：

for(int i = 1;i <= n;i ++ ){
        insert(i,i,a[i]);
    }

二维前缀和的构造：
 

for(int i = 1;i <= n;i ++ ){
        for(int j = 1;j <= m;j ++ ){
            s[i][j] = a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j -1];
        }
    }

对二维前缀和数组进行操作：

for(int i = 0;i < q;i ++ ){
        cin >> x1 >> y1 >> x2 >> y2;
        cout << s[x2][y2] - s[x1 - 1][y2] -s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
    }

二维差分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;
}

二维差分数组b的初始化：

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