#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int main()
{
int n,m,q,s[N][N]={0},i,j;
cin>>n>>m>>q;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>s[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s[i][j]+=s[i-1][j]+s[i][j-1]-s[i-1][j-1];
while(q--)
{
int x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
cout<<s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1]<<endl;
}
}
子矩阵代数和
于 2022-10-30 11:57:50 首次发布