子矩阵的和(Python实现)

 

 代码：

# 输入数据
n, m, q = map(int, input().split())
matrix = []
for i in range(n):
    matrix.append(list(map(int, input().split())))
query = []
for i in range(q):
    query.append(list(map(int, input().split())))

ls = [[0] * (m + 1) for i in range(n + 1)]  # 初始化一个二维数组
# 这里尽量避免用两个列表来完成，因为这样会涉及到Python的深拷贝浅拷贝知识，初学者容易晕

# 计算前缀和
for i in range(1, n + 1):
    for j in range(1, m + 1):
        ls[i][j] = ls[i - 1][j] + ls[i][j - 1] - ls[i - 1][j - 1] + matrix[i - 1][j - 1]

# 最后的计算
for i in range(q):
    x1, y1, x2, y2 = query[i][0], query[i][1], query[i][2], query[i][3]
    print(ls[x2][y2] - ls[x1 - 1][y2] - ls[x2][