题解 | 【模板】二维差分

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n,m,q;
    cin>>n>>m>>q;
    vector<vector<long long>> arr(n+1,vector<long long>(m+1,0));
    for(int i=1;i<n+1;i++){
        for(int j=1;j<m+1;j++){
            cin>>arr[i][j];
        }
    }
    vector<vector<long long>> oper(q,vector<long long>(5,0));
    for(int i=0;i<q;i++){
        cin>>oper[i][0]>>oper[i][1]>>oper[i][2]>>oper[i][3]>>oper[i][4];
    }
    vector<vector<long long>> dp(n+1,vector<long long>(m+1,0));
    for(int i=1;i<n+1;i++){
        for(int j=1;j<m+1;j++){
            dp[i][j]=arr[i][j]-arr[i-1][j]-arr[i][j-1]+arr[i-1][j-1];
        }
    }
    for(int i=0;i<q;i++){
        int x1=oper[i][0];
        int y1=oper[i][1];
        int x2=oper[i][2];
        int y2=oper[i][3];
        int k=oper[i][4];
        dp[x1][y1]+=k;
        if(y2+1<=m) dp[x1][y2+1]-=k;
        if(x2+1<=n) dp[x2+1][y1]-=k;
        if(x2+1<=n && y2+1<=m) dp[x2+1][y2+1]+=k;
    }
    for(int i=1;i<n+1;i++){
        for(int j=1;j<m+1;j++){
            arr[i][j]=arr[i-1][j]+arr[i][j-1]-arr[i-1][j-1]+dp[i][j];
        }
    }
    for(int i=1;i<n+1;i++){
        for(int j=1;j<m+1;j++){
            cout<<arr[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")