AcWing 796. 子矩阵的和
原题链接
简单
作者:
J.D
,
2022-09-23 18:33:48
,
所有人可见
,
阅读 119
核心处理逻辑还是记住s的公式,此外要注意行列m n的关系不要弄反了,否则经常报超过限制
python3 代码
n, m, q = map(int, input().split())
a = s = [[0] * (m+1)] * (n+1)
for i in range(1, n+1):
a[i] = [0] + 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 _ in range(q):
x1, y1, x2, y2 = map(int, input().split())
result = s[x2][y2] - s[x1-1][y2] - s[x2][y1-1] + s[x1-1][y1-1]
print(result)