AcWing 796. 子矩阵的和
原题链接
简单
作者:
我要出去乱说
,
2021-02-05 23:28:35
,
所有人可见
,
阅读 231
#include <cstdio>
const int N = 1010;
int n, m, q;
int a[N][N];
int main()
{
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]);
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", a[x2][y2] - a[x1 - 1][y2] - a[x2][y1 - 1] + a[x1 - 1][y1 - 1]); //想像
}
return 0;
}