摘要：
1146. Maximum SumTime limit: 1.0 second Memory limit: 64 MBGiven 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 re 阅读全文