AcWing 796. 子矩阵的和
原题链接
简单
作者:
blalalt
,
2020-05-03 11:59:32
,
所有人可见
,
阅读 625
C++ 代码
# s[i][j] = a[i][j] + s[i-1][j] + s[i][j-1] - s[i-1][j-1]
#include <iostream>
using namespace std;
const int N = 1000+10;
int s[N][N];
int main() {
int n, m, q;
cin >> n >> m >> q;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
cin >> s[i][j]; // a[i][j]
s[i][j] += s[i-1][j] + s[i][j-1] - s[i-1][j-1];
}
}
int x1, y1, x2, y2;
while (q --) {
cin >> x1 >> y1 >> x2 >> y2;
cout << s[x2][y2] - s[x2][y1-1] - s[x1-1][y2] + s[x1-1][y1-1] << endl;
}
return 0;
}