hdu1081 求最大子矩阵

To The Max

Problem Description

Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 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-rectangle of the array:

0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2

is in the lower left corner:

9 2
-4 1
-1 8

and has a sum of 15.

Input

The input consists of an N x 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].

Output

Output the sum of the maximal sub-rectangle.

Sample Input

4
0 -2 -7 0 9 2 -6 2
-4 1 -4 1 -1
8 0 -2

Sample Output

15

这题使用二维前缀和来解决。
看到这数据范围，才100，果断暴力。

二维前缀和用dp[i][j]来表示，含义是从(1,1)->(i,j)子矩阵的和，那么它怎么求呢，画图可以看得出来。

dp[i][j-1]的面积是A+B，dp[i-1][j]的面积是A+C，那么dp[i][j]不就是A+B+C+D，也就是dp[i][j-1]+dp[i][j-1]-dp[i-1][j-1]+a[i][j]，其中dp[i-1][j-1]就代表A。

求出前缀和后，再去枚举两个顶点，一个是矩阵左上点$(i,j)$，另一个是右下点$(u,v)$，那么 S = d p [ u