백준 2846 오르막길

https://www.acmicpc.net/problem/2846

2846번: 오르막길

n = int(input())
l = list(map(int, input().split()))
if n == 1:
    print(0)
else:
    result = []
    tmp = 0
    for i in range(n-1):
        if l[i] < l[i+1]:
            tmp += (l[i+1] - l[i])
        else:
            result.append(tmp)
            tmp = 0
    result.append(tmp)
    if max(result) > 0:
        print(max(result))
    else:
        print(0)