子矩阵的和

代码

#include<iostream>

using namespace std;


const int N = 1010;

int s[N][N],a[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 >>a[i][j];
            s[i][j] = s[i -1][j] + s[i][j -1] + a[i][j] - s[i -1][j - 1];
        }
    }
    int x1, x2, y1, y2;
    
    while(q--)
    {
        cin >> x1 >> y1 >> x2 >> y2;
        cout << s[x2][y2] + s[x1 -1][y1 - 1] - s[x1 -1][y2] - s[x2][y1 -1] << endl;
    }
    return 0;
}

---

图片来源题解：
子矩阵的和,以包含的点的形式去看这个图，左上角为源点，向右，向下分别为x，y的正方向