hdu 1081 To The Max（dp+化二维为一维）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1081

To The Max

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8839    Accepted Submission(s): 4281

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

 

题目大意：在一个数的矩阵里面找一个和最大矩阵。

题目思路:化二维为一维，转化成1003即可。先求一列一列的和，这样就转化成了一维了。举个例子，我先计算第一行得到dp[0]=0dp[1]=-2,dp[2]=-7,dp[3]=0;这些就是所谓的和，然后在用1003的方法做。那么第二行，就会更新，dp[0]=9,dp[1]=0,dp[2]=-13,dp[3]=2;这些依旧是和，这也就是转换成了一维数组，用1003的方法解决，以此类推~~~

 

详见代码。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int dp[110];
int num[110][110];

int main ()
{
    int n;
    while (~scanf("%d",&n))
    {
        for (int i=0; i<n; i++)
            for (int j=0; j<n; j++)
                scanf("%d",&num[i][j]);
        int ans=-99999;
        for (int i=0; i<n; i++)
        {
            memset(dp,0,sizeof(dp));
            for (int j=i; j<n; j++)
            {
                int Max=-1;
                for (int k=0; k<n; k++)
                {
                    dp[k]+=num[j][k];       //先计算出所有的dp和
                }
                for (int k=0; k<n; k++)     //1003的做法，代码类似
                {
                    if (Max+dp[k]<dp[k])
                        Max=dp[k];
                    else
                        Max=Max+dp[k];
                    if (ans<Max)              //不断更新最大值
                    {
                        ans=Max;
                        //cout<<j<<" "<<k<<endl;
                    }
                }
            }
        }
        printf ("%d
",ans);
    }
    return 0;
}