How to find the maximum amount that can be obtained by adding an arbitrary non-breaking sequence of array elements?

Question

Algorithms

The problem was the following - given an array of up to 200, 000 elements, the elements of which are integers in the range [-10000, 10000].
You need to find the maximum amount that can be obtained by adding an arbitrary inseparable sequence of elements of this array.
The type for the input data [2,-2,-5,2,2,-1,2,-3] will be 5 - the sum of the subarray [2,2,-1,2]
I'm not strong in algorithms, but I kind of felt true, though he forgot about the ridiculous boundary condition and did not have time to finish on time.
How would you go about solving this problem?
The condition also has a limitation on the execution time of the algorithm - no more than 2 seconds in their interpreter.

Answer 1

Yes, I have become quite old - I missed such an elementary algorithm :)

Answer 2

Solution in the forehead

var a = [], // Array
    i = 0, x,
    current = a[0] + a[1],
    max = current;

for (i = 0; i in a; i++) {
    current = a[i];
    for (x = i + 1; x in a; x++) {
        current = current + a[x];
        if (current > max) {
            max = current;
        }
    }
}
console.log('Result:', max);