中南賽區ACM競賽題
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.
ACM Programming contest activity at Stony Brook is sponsored by a grant from Salomon Smith Barney. In the 2002 Greater New York Regional, Stony Brook s teams finished 2nd and 5th with 54 teams competing! In the 2003 Greater New York Regional, Stony Brook finished 4th of 60 teams. In the 2004 Greater New York Regional, three of Stony Brook s teams finished in the top 15 positions!
