So in the book, in dynamic programming - a problem for maximum sum subarray is solved like this
Maximum Sum Ending at j = S( j ) - min k < j (S(k))
The question is why? Explanation is not clear to me. Subtracting some minimum sum - how can it lead to maximum sum?