GO Solution For UVa 10656 - Maximum Sum (II). In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

In a given sequence of non-negative integers you will have to find such a sub-sequence in it whose summation is maximum.

Input The input file contains several input sets. The description of each set is given below:

Each set starts with an integer N (N < 1000) that indicates how many numbers are in


You can find the full details of the problem Maximum Sum (II) at UVa Online Judge

Sample Input


Sample Output

3 4

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985