796. 子矩阵的和

Posted 2021-05-20 幽殇默

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

#include<cstdio>
#include<iostream>
using namespace std;
const int N=1010;
int a[N][N],s[N][N],n,m,q;
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];
            s[i][j]=s[i-1][j]+s[i][j-1]+a[i][j]-s[i-1][j-1];
        }
    }
    while(q--)
    {
        int x,y,xx,yy; cin>>x>>y>>xx>>yy;
        cout<<s[xx][yy]+s[x-1][y-1]-s[xx][y-1]-s[x-1][yy]<<endl;
    }
    return 0;
}