AcWing_796 子矩阵的和(二维的前缀和、模板)

#include <bits/stdc++.h>
using namespace std;
int n, m, q;
const int N = 1010, M = 1010;
int s[N][M];
int main(){
    cin >> n >> m >> q;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++){
            cin >> s[i][j];
            s[i][j] = s[i][j] + s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1];
        }
    while(q --){
        int x1, y1, x2, y2;
        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;
}