Maximum Product Subarray

Difficulty: 1500 5000 ms 128 MB

dp

Find the maximum product of any non-empty contiguous subarray.

Input: the first line has N; the second line has N integers.

Output: the maximum subarray product.

Constraints:

• 1 ≤ N ≤ 3000
• |a_i| ≤ 10

Sample Tests

4
2 -3 -2 4

48

3
-2 0 -1

0

Read the Editorial