AcWing 796. 子矩阵的和
原题链接
简单
作者:
wzc1998
,
2021-01-15 20:51:23
,
所有人可见
,
阅读 404
#include <iostream>
using namespace std;
int n, m, q, x1, x2, y1, y2;
const int maxn = 1010;
int a[maxn][maxn];
int s[maxn][maxn];
int main(){
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][j - 1] + s[i - 1][j] - s[i - 1][j - 1] + a[i][j];
}
}
while(q --){
cin >> x1 >> y1 >> x2 >> y2;
cout << s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
}
return 0;
}