#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int n,m,q;
int s[N][N];
int main()
{
cin >> n>> m >>q;
for (int i = 1; i <= n; i ++ )
{
for(int j=1;j<=m;j++)
{
cin >> s[i][j];
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+s[i][j]; //求二维前缀和
}
}
while(q--)
{
int x1,y1,x2,y2;
cin >> x1>>y1>>x2>>y2;
cout << s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1]<<endl; //输出(x1,y1)(x2,y2)间的子矩阵的和
}
return 0;
}
蓝桥模板题之二维前缀和
最新推荐文章于 2024-07-25 18:22:10 发布