POJ-1050-To the Max-二维最大子序列和

题目来源：http://poj.org/problem?id=1050
题目内容：To the Max
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 50099 Accepted: 26544
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.
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 * 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
Source

Greater New York 2001
题目分析：
给一个n阶矩阵，求n阶矩阵中子矩阵元素构成的最大和。
在做此题之前先来看一道简单的例题：

求：长度为n的序列中最大的子序列和。

dp[i]:以第i个元素结尾的最大序列和
int maxLen = -1;
for(int i = 1 ; i <= n ; i ++){
    if(dp[i-1] >= 0){
        dp[i] += arr[i];
    }else{
        dp[i] = arr[i];
    }
    maxLen = max(dp[i],maxLen);
}

这题的子矩阵其实就是子序列的升级版，要知道矩阵是规则图形，相当于把线段拉伸形成的，所以我们只需要在子序列的基础上添加代码就行了。
dp[i][j][k]:从第1行到第i行，第j列为起始列，第k列为终止列所围成的最大的子矩阵。

int ans = -1;
for(int i = 1 ; i <= n ; i ++){
    for(int j = 1 ; j <= n ; j ++){

        int sum = 0;
        for(int k =j; k <= n ; k ++){
            sum += arr[i][k];
            dp[i][j][k] = max(dp[i][j][k-1] + sum,sum);
            //dp[i][j][k]表示子矩阵行为1...i,列为j.....k内的 和最大值
            ans = max(ans,dp[i][j][k]);
        }
    }
}
cout << ans <<endl;