Buy Low, Sell High

n = int(input())
l = [int(x) for x in input().split()]
le = len(l)
a = [0] * le

a[0] = -l[0]
for i in range(1, le):
 a[i] = max(a[i-1],-l[i])

a[0] = 0
for i in range(1, le): 
 a[i] = max(a[i-1], a[i] + l[i])

a[0] = -l[0]
for i in range(1, le):
 a[i] = max(a[i-1], a[i] - l[i])

a[0] = 0
for i in range(1, le):
 a[i] = max(a[i-1], a[i] + l[i])

print(a[-1])

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED