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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC116_C solver = new ABC116_C();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC116_C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int h[] = new int[n];
            int ans = 0;
            int max = 0;
            for (int i = 0; i < n; i++) {
                h[i] = in.nextInt();
                max = Math.max(max, h[i]);
            }
            int startIndex = 0;
            int endIndex = h.length - 1;
            for (int i = startIndex; i <= endIndex; i++) {
                if (h[i] != 0) {
                    startIndex = i;
                    break;
                }
            }

            for (int i = endIndex; startIndex <= i; i--) {
                if (h[i] != 0) {
                    endIndex = i;
                    break;
                }
            }
            boolean repeatingZero = false;
            while (max > 0) {
                for (int i = startIndex; i <= endIndex; i++) {
                    if (h[i] == 0 && !repeatingZero) {
                        ans++;
                        repeatingZero = true;
                    }

                    if (h[i] != 0 && repeatingZero) {
                        repeatingZero = false;
                    }

                    if (h[i] > 0) {
                        h[i]--;
                    }
                }

                ans++;

                for (int i = startIndex; i <= endIndex; i++) {
                    if (h[i] != 0) {
                        startIndex = i;
                        break;
                    }
                }

                for (int i = endIndex; startIndex <= i; i--) {
                    if (h[i] != 0) {
                        endIndex = i;
                        break;
                    }
                }

                max--;
            }

            out.print(ans);

        }

    }
}