Submission #647179

#	Time	Username	Problem	Language	Result	Execution time	Memory
647179		beaconmc	Growing Vegetables is Fun 4 (JOI21_ho_t1)	Pypy 3	100 / 100	142 ms	50284 KiB

Main

n = int(input())
lis = list(map(int, input().split()))

a = [0]
b = [0]

for i in range(len(lis)-1):
    a.append(a[-1] + max(0,lis[i]-lis[i+1]+1))
lis.reverse()
for i in range(len(lis)-1):
    b.append(b[-1] + max(0,lis[i]-lis[i+1]+1))
b.reverse()
print(min([max([a[i],b[i]]) for i in range(len(a))]))
    

• Subtask 1: 40 / 40
• Subtask 2: 60 / 60