{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"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.\r\u003cbr\u003eAs an example, the maximal sub-rectangle of the array:\r\u003cbr\u003e\r\u003cbr\u003e 0 -2 -7 0\r\u003cbr\u003e 9 2 -6 2\r\u003cbr\u003e-4 1 -4 1\r\u003cbr\u003e-1 8 0 -2\r\u003cbr\u003eis in the lower left corner:\r\u003cbr\u003e\r\u003cbr\u003e 9 2\r\u003cbr\u003e-4 1\r\u003cbr\u003e-1 8\r\u003cbr\u003eand has a sum of 15.\r\u003cbr\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of an N * N array of integers. The input begins with a single positive integer N on a line by itself, indicating the size of the square two-dimensional array. This is followed by N^2 integers separated by whitespace (spaces and newlines). These are the N^2 integers of the array, presented in row-major order. That is, all numbers in the first row, left to right, then all numbers in the second row, left to right, etc. N may be as large as 100. The numbers in the array will be in the range [-127,127]."}},{"title":"Output","value":{"format":"HTML","content":"Output the sum of the maximal sub-rectangle."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4\r\n0 -2 -7 0 9 2 -6 2\r\n-4 1 -4 1 -1\r\n\r\n8 0 -2\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e15\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}