Read a positive natural number n followed by n integers forming a sequence v[1], v[2], ..., v[n]. For a contiguous subarray v[i], v[i+1], ..., v[j] the sum is defined as v[i] + v[i+1] + ... + v[j].
Determine the maximum sum over all contiguous subarrays containing at least one element.
The first line contains `n`. The second line contains `n` integers separated by spaces. - `1 <= n <= 1000` - `-1000 <= v[i] <= 1000` - the subarray must contain at least one element
Print a single integer: the maximum subarray sum, followed by a newline.
8 -2 1 -3 4 -1 2 1 -5
6
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
8 -2 1 -3 4 -1 2 1 -5
6
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
