POJ 1050 to the max（dp）

原题描述：
To the Max
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 45592 Accepted: 24123
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

题目大意：
找一个和最大的子矩阵

分析：
有一个dp问题，是和最大的连续子序列，状态转移方程是
dp[i]=max(num[i],dp[i-1]+num[i]),时间复杂度是o（n）
同样，这个二维的可以先确定子矩阵的上下两个边界，然后把边界内的同一列加起来，转化成一维做，这样复杂度是o（n^3）

代码：

#include "stdio.h"
#include "algorithm"
using namespace std;
int n;
int num[100+5][100+5];
int sum[100+5][100+5];
int dp[100+5];
int main()
{
    int i,j,k;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<n;i++)
        {
            for(j=0;j<n;j++)
            {
                scanf("%d",&num[i][j]);
                if(i==0){
                    sum[i][j]=num[i][j];
                }else{
                    sum[i][j]=num[i][j]+sum[i-1][j];
                }
            }

        }
        int mx=0xff3f3f3f;
        for(i=0;i<n;i++)
        {
            for(j=i;j<n;j++)
            {
                for(k=0;k<n;k++)
                {
                //不管dp[k-1]为什么，都先把这一列的和加给dp[k]
                    dp[k]=sum[j][k]-sum[i][k]+num[i][k];
                    if(k!=0&&dp[k-1]>0){//dp[k-1]为正就加过来
                        dp[k]+=dp[k-1];
                    }
                    if(mx<dp[k]){
                        mx=dp[k];
                    }
                }
            }
        }
        printf("%d\n",mx);
    }
    return 0;
}