To the Max
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 38220
Accepted: 20161
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.
As an example, the maximal sub......
阅读全文