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 Scala (2.11.7) (judge verdict: Wrong Answer)

import scala.util.control.Breaks

object Main extends App {
  var n = scala.io.StdIn.readInt()
  var s = scala.io.StdIn.readLine()
  var inputArray =  s.split(" ").map(_.toInt)
  var i = 0

  def minusWater(s: Seq[Int]): Seq[Int] = {
    var arrayIndex = Seq.empty[Int]
    val maxIndex = s.indexOf(s.max)
    val b1 = new Breaks
    b1.breakable{
      for(i<-maxIndex to n - 1) {
        if (s(i) == 0) {
          b1.break()
        } else {
          arrayIndex :+= i
        }
      }
    }
    if (maxIndex > 0) {
      val b2 = new Breaks
      b2.breakable{
        for(i<-(maxIndex-1) to 0 by -1) {
          if (s(i) == 0) {
            b2.break()
          } else {
            arrayIndex :+= i
          }
        }
      }
    }

    s.zipWithIndex.map{ h =>
      if (arrayIndex.find(_ == h._2).isDefined) {
        h._1 - 1
      }else {
        h._1
      }
    }
  }

  def judgeSeq(s: Seq[Int]): Unit = {
    i += 1
    val seqAfterWater = minusWater(s)
    if (seqAfterWater.filterNot(_ == 0).isEmpty) {
      println(i)
    } else {
      judgeSeq(seqAfterWater)
    }
  }
  judgeSeq(inputArray)
}