POJ1050 To the Max DP

基础的一道DP，求最大子矩阵和，转化成最大字串和来做，数据范围不大，n^3足以解决

To the Max

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 39104		Accepted: 20648

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

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>

using namespace std;

int n,ans;
int sum[110][110];
int a[110][110];

int main(){
    while(cin>>n){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                scanf("%d",&a[i][j]);
        for(int i=1;i<=n;i++)
            sum[0][i]=0;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                sum[i][j]=sum[i-1][j]+a[i][j];
        ans=-0x3f3f3f3f;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i+j-1>n) break;
                int tmpMax=sum[i+j-1][1]-sum[i-1][1];
                int tmpSum=sum[i+j-1][1]-sum[i-1][1];
                for(int k=2;k<=n;k++){
                    int tmp=sum[i+j-1][k]-sum[i-1][k];
                    if(tmpSum>=0)
                        tmpSum+=tmp;
                    else
                        tmpSum=tmp;
                    tmpMax=max(tmpMax,tmpSum);
                }

                ans=max(ans,tmpMax);
            }
        }
         printf("%d\n",ans);
    }
    return 0;
}