create and build an array that stores minimum sums of subarrays that lie in arr [ 0. . . i ]
int leftMin [ n ] ; maxLeftSubArraySum ( invertArr , n , leftMin ) ; for ( int i = 0 ; i < n ; i ++ ) leftMin [ i ] = - leftMin [ i ] ;