补全代码:将列表变为非递减,每次+1,求最少操作次数
n = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(1,n):
if a[i-1] > a[i]:
cnt += __①__
__②__
print(cnt)
a[i-1]-a[i] , a[i] = a[i-1]
a[i]-a[i-1] , a[i-1]=a[i]
a[i-1]+a[i] , a[i] +=1
a[i]*2 , a[i-1]=a[i]