#include<iostream>
using namespace std;
const int N = 1010;
int a[N][N], s[N][N];
int n, m, q;
int x1, x2, y1, y2;
int main()
{
scanf("%d%d%d", &n, &m, &q);
for(int i = 1; i <= n; i ++ ){
for(int j = 1; j <= m; j ++ ){
scanf("%d", &a[i][j]);
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j];
}
}
while(q -- ){
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
int t = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1];
printf("%d\n", t);
}
return 0;
}
AcWing 796 子矩阵的和 题解(二位前缀和 模板)
最新推荐文章于 2022-03-22 11:08:13 发布