Problem:
Score : 300 points

Problem Statement

In a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.
You are given a sequence h=\{h_1,h_2,h_3,......\} as input. You would like to change the height of Flower k to h_k for all k (1 \leq k \leq N), by repeating the following "watering" operation:

Specify integers l and r. Increase the height of Flower x by 1 for all x such that l \leq x \leq r.

Find the minimum number of watering operations required to satisfy the condition.

Constraints

1 \leq N \leq 100

0 \leq h_i \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
h_1 h_2 h_3 ...... h_N

Output

Print the minimum number of watering operations required to satisfy the condition.

Sample Input 1

4
1 2 2 1

Sample Output 1

2

The minimum number of watering operations required is 2.
One way to achieve it is:

Perform the operation with (l,r)=(1,3).

Perform the operation with (l,r)=(2,4).

Sample Input 2

5
3 1 2 3 1

Sample Output 2

5

Sample Input 3

8
4 23 75 0 23 96 50 100

Sample Output 3

221

Solution in Python (3.4.3) (judge verdict: Accepted)

N = int(input())
h_list = [int(h) for h in input().split()]

h_min = min(h_list)
for i in range(N):
    h_list[i] -= h_min
ans = h_min
judge = 0
while judge == 0:
    for i in range(N):
        if h_list[i] != 0:
            r = i
            break
        r = -1
    if r == -1:
        break
    for j in range(r,N):
        if h_list[j] == 0:
            l = j-1
            break
        l = j
    temp = h_list[r:l+1]
    temp_min = min(temp)
    for k in range(r,l+1):
        h_list[k] -= temp_min
    ans += temp_min
    
print(ans)