Find the maximum subarray sum after reversing the subarray arr [ 0. . . i ] for all possible values of i
vector < int > copyArr = arr ; for ( int i = 1 ; i < size ; i ++ ) { getUpdatedArray ( arr , copyArr , i ) ; resSum = max ( resSum , maxSumSubarray ( copyArr , size ) ) ; }