Problem of the day
The sum of an empty subarray is 0.
The first line of input contains an integer N, representing the length of the array.
The second line of input contains N single space-separated integers, denoting the elements of the array.
In the only output line, output the maximum subarray sum.
You are not required to print the output explicitly, it has already been taken care of. Just implement the function.
1 <= N <= 10^6
-10^6 <= A[i] <= 10^6
where N is the length of the array.
A[i] represents the numbers present in the array.
Time limit: 1sec
9
1 2 7 -4 3 2 -10 9 1
11
The subarray yielding maximum sum is [1, 2, 7, -4, 3, 2].
6
10 20 -30 40 -50 60
60
3
-3 -5 -6
0