AcWing 796. 子矩阵的和
原题链接
简单
作者:
洛白さん
,
2022-07-08 11:11:02
,
所有人可见
,
阅读 112
#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m, q;
int a[N][N], s[N][N];
int main() {
cin >> n >> m >> q;
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= m; j ++){
cin >> a[i][j];
}
}
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= m; j ++){
s[i][j] = s[i - 1][j] + s[i][j - 1] + a[i][j] - s[i - 1][j - 1];
}
}
while(q --){
int a1, b1, a2, b2;
cin >> a1 >> b1 >> a2 >> b2;
printf("%d\n", s[a2][b2] - s[a2][b1 - 1] - s[a1 - 1][b2]+ s[a1 - 1][b1 - 1]);
}
return 0;
}