문제 링크 : 백준 1912번
기본 : m = [ 10, -4, 3, 1, 5, 6, -35, 12, 21, -1 ]
i = 1
dy[1] = max( -4, -4 + 10 = 6 ) -> dy[1] = 6
m = [ 10, 6, 3, 1, 5, 6, -35, 12, 21, -1 ]
i = 2
dy[2] = max( 3, 3 + 6 = 9 ) -> dy[2] = 9
m = [ 10, 6, 9, 1, 5, 6, -35, 12, 21, -1 ]
.
.
.
최종 : m = [ 10, 6, 9, 10, 15, 21, -14, 12, 33, 32 ]