Maximum sum 2-d subarray
Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. A sub-rectangle is any contiguous sub-array of size 
or greater located within the whole array. As an example, the maximal sub-rectangle of the array:
or greater located within the whole array. As an example, the maximal sub-rectangle of the array: is in the lower-left-hand corner:
and has the sum of 15.
please see the code: http://ideone.com/4RRJA# and post your comment in case of any improvement or suggestion..
ReplyDelete