题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
python 代码
s=[[0 for i in range(1010)] for j in range(1010)]
a=[[0 for i in range(1010)] for j in range(1010)]
n,m,q=map(int,input().split())
for i in range(1,n+1):
a[i][1:]=list(map(int,input().split()))
for i in range(1,n+1):
for j in range(1,m+1):
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j]
for k in range(q):
x1,y1,x2,y2=map(int,input().split())
t=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1]
print(t)