Description: ACM South Division title race Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1* 1 or greater located within the whole array. 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.
- [1] - ACM South Division title race this title
- [3] - The Description It's not surprising that
File list (Check if you may need any files):
Download