《二维前缀和》

#include <bits/stdc++.h>

using namespace std;

const int N = 1010;

int a[N][N], S[N][N];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m, q;
    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] - S[i - 1][j - 1] + a[i][j];
    
    while (q --)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        
        int res = S[x2][y2] - S[x1 - 1][y2] - S[x2][y1 - 1] + S[x1 - 1][y1 - 1];
        cout << res << endl;
    }
    
    return 0;
}