Submission

Status:

[PP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: agnes_chan

Problemset: ซื้อขายหุ้นซีเค

Language: python

Time: 0.011 second

Submitted On: 2026-05-05 20:55:32

N,T = int(input()) , list(map(int,input().split()))
p , mx = [0]*N , 0
p[-1] = T[-1]
for i in range(-2,-N,-1): p[i] = max(p[i+1],T[i])
for i in range(N-1): mx = max(mx,p[i+1]-T[i])
print(mx)