子矩阵的和（前缀和的二维版）

https://www.acwing.com/problem/content/798/

#include<iostream>

using namespace std;

const int N = 1010;

int a[N][N], s[N][N];
int m, n, q;

int main()
{
    scanf("%d%d%d", &m, &n, &q);
    
    for(int i = 1; i <= m; i++)
    for(int j = 1; j <= n; j++)
    scanf("%d", &a[i][j]);
    
    for(int i = 1; i <= m; i++)
    for(int j = 1; j <= n; j++)
    s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j];  //矩阵和的初始化
                                                         //注意 s[i - 1][j - 1] 被加了两次
    while(q--)
    {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        
        printf("%d\n", s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]);
 //求子矩阵和              
 //这里的 “减一”参考一维前缀和进行理解； s[x1 - 1][y1 - 1] 被减了两次
    }
    
    return 0;
}