#include<iostream>
using namespace std;
const int N = 1010;
int n, m, q;
int a[N][N], s[N][N];
int main()
{
//读入数据至行数为n列数为m的矩阵
scanf("%d%d%d", &n, &m, &q);
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
scanf("%d", &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];
//若想节约空间 使a数组成为自身的前缀和数组
//则可以写成a[i][j]+=a[i-1][j]+a[i][j-1]-a[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[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
}
return 0;
}
二维前缀和模板
最新推荐文章于 2023-02-27 10:25:41 发布