a = int(input())
b = list(map(int,input().split()))
sum = 0
for i in range(1,len(b)):
sum = max(sum,b[i]-b[i-1])
print(sum)
蓝桥杯 最大间隙 python解法
于 2023-03-10 10:48:56 首次发布
a = int(input())
b = list(map(int,input().split()))
sum = 0
for i in range(1,len(b)):
sum = max(sum,b[i]-b[i-1])
print(sum)