每日一题11_子矩阵的和

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1010;
int g[N][N];
int s[N][N];
int n,m;
int num;
int x1,y1,x2,y2;
int main()
{
cin>>n>>m>>num;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>g[i][j];
s[i][j]=s[i][j-1]+s[i-1][j]-s[i-1][j-1]+g[i][j];
}
}


while(num--)
{
cin>>x1>>y1>>x2>>y2;
cout<<s[x2][y2]-s[x2][y1-1]-s[x1-1][y2]+s[x1-1][y1-1]<<endl;
}
return 0;
}