AcWing 796. 子矩阵的和
原题链接
简单
作者:
小点点吃飞飞鱼
,
2024-05-25 23:48:13
,
所有人可见
,
阅读 1
#include <iostream>
using namespace std;
const int N = 1010;
const int M = 200010;
int n,m,q;
int arr[N][N];
int x1,y1,x2,y2;
int ans[M];
int xsum[N][N];
int ysum[N];
int main()
{
cin >> n >> m >> q;
for(int i = 1;i <= n;i ++){
for(int j = 1;j <= m;j ++){
cin >> arr[i][j];
xsum[i][j] = xsum[i][j - 1] + arr[i][j];
}
}
for(int k = 1;k <= q;k ++){
cin >> x1 >> y1 >> x2 >> y2;
for(int i = x1;i <= x2;i ++){
ans[k] += xsum[i][y2] - xsum[i][y1 - 1];
}
}
for(int i = 1;i <= q ;i++){
cout << ans[i] << endl;
}
return 0;
}