差分数组
对于一个数组a,差分数组diff[]的定义是:
diff[i] = a[i] 1 a[i-1]
例如:
diff[1] = a[1]
diff[2] = a[2] - a[1]
…
diff[n] = a[n] - a[n-1]
对差分数组做前缀和,可以还原为原数组:
diff[1] + diff[2] + diff[3] +… + diff[i]
=a[1] + (a[2] - a[1]) + (a[3] - a[2]) +…+ (a[i] - a[i-1])
=a[i]
原数组:
[1,3,5,6,7]
变化:区间2到4的各元素+5
[1,3,5,6,7]——>[1,8,10,11,7]
差分数组:
[1,2,2,1,1]
变化:第2位+5,最后1位-5:
[1,2,2,1,1]——>[1,7,2,1,-4]
即:
原数组执行区间加法[l,r]都加上x,对于差分数组而言:
diff[l] += x
diff[r+1] -= x
①差分数组可以实现快速的区间加法,最终只需对差分数组求前缀和就能得到原数组。
②无法边修改边查询,只能先修改后查询
③diff[l] += x,相当于从l往后全部数字都加上x
④diff[r+1] -= x,相当于从r-1后全部数字都减去x
3291区间更新
题目链接:3291区间更新
while True:
try:
n, m = map(int, input().split())
a = list(map(int, input().split()))
# 构建差分数组
diff = [0] * (n + 1)
diff[0] = a[0]
for i in range(1, n):
diff[i] = a[i] - a[i - 1]
# 区间求和转换成差分数组
for _ in range(m):
x, y, z = map(int, input().split())
# x, y = x - 1, y - 1
# diff[x] += z
# diff[y + 1] -= z
diff[x - 1] += z
diff[y] -= z
# 对差分数组求前缀和
a[0] = diff[0]
for i in range(1, n):
a[i] = a[i - 1] + diff[i]
print(' '.join(map(str, a)))
except:
break
运行结果
10 5
0 0 0 0 0 0 0 0 0 0
1 5 1
2 6 1
3 7 1
4 9 1
5 10 1
1 2 3 4 5 4 3 2 2 1
1 1
1
1 1 2
3
二维差分数组
差分数组的前缀和 = 原数组
之前二维数组前缀和表达是:
sumi,j = sumi-1,j +sumi,j-1 -sumi-1,j-1 +ai,j
上述sum替换为a,a替换为diff,就可以得到二位差分数组
ai,j = ai-1,j +ai,j-1 -ai-1,j-1 +diffi,j
即:
diffi,j =ai,j - ai-1,j -ai,j-1+ai-1,j-1
def output(a,n):
for i in range(1,n+1):
print(" ".join(map(str,a[i][1:])))
print()
n , m = map(int,input().split())
#下标从1开始
a = [ [0]*(m+1) for i in range(n+1) ]
diff = [ [0]*(m+1) for i in range(n+1) ]
#print(a)
#输入一个二维数组
for i in range(1,n+1):
a[i] = [0] + list(map(int,input().split()))
#print(a[i])
output(a,n)
for i in range(1,n+1):
for j in range(1,n+1):
diff[i][j] = a[i][j]-a[i-1][j]-a[i][j-1]+a[i-1][j-1]
output(diff,n)
运行结果
4 4
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
1 1 1 1
4 0 0 0
4 0 0 0
4 0 0 0
矩阵(x1,y1) - (x2,y2)需要增加元素x
diff[x1][y1] += x
diff[x1][y2+1] -= x
diff[x2+1][y1] -= x
diff[x2+1][y2+1] += x
参考链接:https://blog.csdn.net/Charlie482/article/details/136380969?spm=1001.2014.3001.5502