前缀和与差分[D8](12.24)

795. 前缀和 - AcWing题库

AcWing 795. 前缀和

n, m = map(int, input().split())
ls = list(map(int,input().split()))
a = [0] + ls
s = [0] * (len(ls)+1)
for i in range(1,len(a)):
    s[i] = s[i-1] +a[i]
for i in range(m):
    l, r = map(int, input().split())
    sum = s[r] - s[l-1]
    print(sum)

796. 子矩阵的和 - AcWing题库

AcWing 796. 子矩阵的和

n, m, q = map(int, input().split())
a = [[0] * (m + 1) for _ in range(n + 1)]
s = [[0] * (m + 1) for _ in range(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())
    res = s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]
    print(res)

797. 差分 - AcWing题库

AcWing 797. 差分

n, m = map(int, input().split())
ls = list(map(int, input().split()))
a = [0] * (n + 1)
b = [0] * (n + 1)
b[0] = ls[0]
for i in range(1,n):
    b[i] = ls[i] - ls[i-1]
for _ in range(m):
    l, r, c = map(int, input().split())
    b[l-1] +=c    
    b[r] -=c
for j in range(1,n+1):
    a[j] =a[j-1] + b[j-1] 
print(' '.join(map(str,a[1:])))

798. 差分矩阵 - AcWing题库

AcWing 798. 差分矩阵

n, m, q = map(int, input().split())
a = [[0 for i in range(m + 2)] for i in range(n + 2)]
b = [[0 for i in range(m + 2)] for i in range(n + 2)]
res = [[0] * (m + 2) for _ in range(n + 2)]
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):
        b[i][j] = a[i][j] + a[i - 1][j - 1] - a[i - 1][j] - a[i][j - 1]
for _ in range(q):
    x1, y1, x2, y2, c = map(int, input().split())
    b[x1][y1] += c
    b[x2 + 1][y2 + 1] += c
    b[x2 + 1][y1] -= c
    b[x1][y2 + 1] -= c
for i in range(1, n + 1):
    for j in range(1, m + 1):
        res[i][j] = res[i - 1][j] + res[i][j - 1] - res[i - 1][j - 1] + b[i][j]
for i in range(1, n + 1):
    for j in range(1, m + 1):
        print(res[i][j], end=' ')
    print('')