第2天（前缀和与差分）

一、前缀和

①一维：求指定区间[l,r]的和，将时间复杂度降低到O(n)

一维

n,m = map(int,input().split())
lst = list(map(int,input().split()))
pre = [0 for _ in range(n + 1)]
for i in range(1,n+1):
    pre[i] = pre[i-1] + lst[i-1]
# print(pre)
while m:
    l,r = map(int,input().split())
    res = pre[r] - pre[l-1]
    print(res)
    m -= 1

②二维：输出指定子矩阵的和。

二维

n,m,q = map(int,input().split())
lst = [[0 for _ in range(m+1)] for _ in range(n+1)]
for i in range(1,n + 1):
    lst[i] = [0] + list(map(int,input().split()))
for i in range(1,n + 1):
    for j in range(1,m + 1):
        lst[i][j] = lst[i][j] + lst[i-1][j] + lst[i][j-1] - lst[i-1][j-1]
while q:
    x1,y1,x2,y2 = map(int,input().split())
    res = lst[x2][y2] - lst[x1-1][y2] - lst[x2][y1-1] + lst[x1-1][y1-1]
    print(res)
    q -= 1
        

 

 二、差分

①一维：

一维

n,m = map(int,input().split())
lst = [0]+list(map(int,input().split()))
diff = [0 for _ in range(n+2)]
def insert(l,r,c):
    diff[l] += c
    diff[r+1] -= c
for i in range(1,n+1):
    insert(i,i,lst[i])
while m:
    l,r,c = map(int,input().split())
    insert(l,r,c)
    m -= 1
for i in range(1,n+1):
    diff[i] += diff[i-1]
    print(diff[i],end = " ")

 ②二维：

二维

n,m,q = map(int,input().split())
lst = [[0 for _ in range(m+2)] for _ in range(n+2)]
for i in range(1,n + 1):
    lst[i] = [0] + list(map(int,input().split())) + [0]
diff = [[0 for _ in range(m+2)]for _ in range(n+2)]
def insert(x1,y1,x2,y2,c):
    diff[x1][y1] += c
    diff[x1][y2+1] -= c
    diff[x2+1][y1] -= c
    diff[x2+1][y2+1] += c
for i in range(1,n+1):
    for j in range(1,m+1):
        insert(i,j,i,j,lst[i][j])
while q:
    x1,y1,x2,y2,c = map(int,input().split())
    insert(x1,y1,x2,y2,c)
    q -= 1
for i in range(1,n+1):
    for j in range(1,m+1):
        diff[i][j] = diff[i][j] + diff[i-1][j] + diff[i][j-1] - diff[i-1][j-1]
for i in range(1,n+1):
    for j in range(1,m+1):
        print(diff[i][j],end = " ")
    print()