Maximum Subarray

Medium2 pts

ArrayDynamic ProgrammingGreedy

PrerequisitesArray, Dynamic Programming, Greedy

Return the largest sum of any contiguous subarray.

Input: space-separated integers.
Output: the maximum subarray sum.

Example 1

Input

-2 1 -3 4 -1 2 1 -5 4

Output

Explanation

For the given input, the program prints exactly this output.

Example 2

Input

5 4 -1 7 8

Output

Explanation

A second case — verify your logic handles it too.

Hints

Video

import sys
 
def solve():
    data = sys.stdin.read().split()
    # TODO: write your solution
    print()
 
solve()

8 lines

Input (stdin)

Expected output · optional

Run checks your code against every example, one by one — all must pass. Type your own input above to run that instead (Run compares it to the expected output if you set one). The full suite is checked on Submit — a failing case reveals its input & expected output.