提交时间:2025-12-06 13:27:03
运行 ID: 365993
#include<bits/stdc++.h> using namespace std; long long a[10005][10005],s[10005][10005],q; int main() { long long n,m,x1,y1,x2,y2; 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]); s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j]; } } for (int i = 1; i <= q; i++) { 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; }