CSES Problemset/Sorting and Searching
Maximum Subarray Sum
#1643Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude DesktopGiven an array of integers, your task is to find the maximum sum of values in a contiguous, nonempty subarray.
Input
The first input line has an integer : the size of the array.
The second line has integers : the array values.
Output
Print one integer: the maximum subarray sum.
Constraints
Sample Test Cases (1)
Example 1ID: sample-1
Input
8 -1 3 -2 5 3 -5 2 2
Expected Output
9
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 charsTest Bench
Input (stdin)
8 -1 3 -2 5 3 -5 2 2
Expected Output
9