Problem:
Maximum Sum Sequence

Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.

Input

The input consists of multiple datasets. Each data set consists of:

n
a1
a2
.
.
an

You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.

The input end with a line consisting of a single 0.

Output

For each dataset, print the maximum sum in a line.

Sample Input

7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0

Output for the Sample Input

19
14
1001

Solution in Scala (judge verdict: Wrong Answer)

import scala.io.StdIn._

object Main {
  def main(args: Array[String]): Unit = {
    while (true) {
      val n = readInt
      if (n == 0) return

      var list: Array[Long] = Array.empty
      for (i <- 0 until n) {
        list :+= readInt.toLong
      }
      println(execute(list))
    }

    //println(execute(Array(-5, -1, 6, 4, 9, -6)))
  }

  def execute(list: Array[Long]): Long = {
    var result = new Array[Array[Long]](list.length)
    var max = list(0)

    for (i <- 0 until list.length) {
      result(i) = new Array[Long](list.length)
      result(i)(i) = list(i)
      for (j <- i + 1 until list.length) {
        result(i)(j) = list(j) + result(i)(j - 1)
        max = Math.max(result(i)(j), max)
      }
      //result(i).foreach(x => print(x + " "))
      //println()
    }

    max
  }
}