Given an array of $$$n$$$ integers, your task is to find the maximum sum of values in a contiguous, nonempty subarray.
The first input line has an integer n: the size of the array.
The second line has $$$n$$$ integers $$$x_1,x_2,\dots,x_n$$$: the array values.
Constraints:
Print one integer: the maximum subarray sum.
8 -1 3 -2 5 3 -5 2 2
9
Name |
---|