Consider a sequence of 15 elements: A = [10, -11, 5, -4, 0, 5, -4, -2, -7, 11, -1, 0, 2, -3, 15].
The subsequence sum \(S\left( {i,j} \right) = \mathop \sum \nolimits_{k = i}^j A\left[ k \right]\). Determine the maximum of S(i, j),
where 0 ≤ i ≤ j < 15.
Enter numerical value using the virtual keypad. Round off where necessary.