AcWing 796. 子矩阵的和
原题链接
简单
作者:
代码怎么敲
,
2025-04-14 22:59:07
· 山东
,
所有人可见
,
阅读 3
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n,m,q;
int s[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 ++ )
cin >> s[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];
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]);
}
}