#include<iostream>
const int N = 1010;
int s[N][N];
int m,n,q,x1,y1,x2,y2;
using namespace std;
int main()
{
cin>>n>>m>>q;
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=m;j++)
{
cin>>s[i][j];
s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
}
}
while(q--)
{
cin>>x1>>y1>>x2>>y2;
printf("%d\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
}
return 0;
}
AcWing.796 子矩阵的和
最新推荐文章于 2024-10-02 20:11:23 发布