扩展到二维的前缀和问题。求由对角点为(x1, y1)、(x2,y2)构成的矩形中的点的和即
sum[x2][y2] - sum[x1-1][y2] - sum[x2][y1-1] + sum[x1-1][y1-1]
#include <iostream>
using namespace std;
const int MAXN = 1005;
int value[MAXN][MAXN];
int sum[MAXN][MAXN]; //sum[i][j]表示的是由((1, 1), (1, j), (i, 1), (i, j))四点围成的矩形内所有点的和
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 >> value[i][j];
sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + value[i][j];
}
}
while(q--) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int res = sum[x2][y2] - sum[x1-1][y2] - sum[x2][y1-1] + sum[x1-1][y1-1];
cout << res << endl;
}
return 0;
}