Oyking

摘要： 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 themaximal sub-rectangle. A sub-rectangle is a 阅读全文