798. 差分矩阵

Posted 2021-05-20 幽殇默

https://www.acwing.com/problem/content/description/800/

#include<cstdio>
#include<iostream>
using namespace std;
const int N=1e3+10;
int a[N][N],b[N][N],n,m,q;
void insert(int x1,int y1,int x2,int y2,int c)
{
    b[x1][y1]+=c;
    b[x1][y2+1]-=c;
    b[x2+1][y1]-=c;
    b[x2+1][y2+1]+=c;
}
int main(void)
{
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
            insert(i,j,i,j,a[i][j]);
        }
    }
    
    while(q--)
    {
        int x,y,xx,yy,w; cin>>x>>y>>xx>>yy>>w;
        insert(x,y,xx,yy,w);
    }
    
    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];
            cout<<b[i][j]<<" ";
        }
        cout<<endl;
    }
}