poj1050 to the max (DP)

求一个二维的连续子序和最大值

要点：第i列到第j列，可以加和变成一个序列，再求这一个序列的连续子序和最大值。

To the Max

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 38322		Accepted: 20212

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 <cstdio>
#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <string.h>
using namespace std;
const int maxn=102;
int a[maxn][maxn];
int temp[maxn];
int dp[maxn];
int n;
void add(int i,int j)
{
	for(int k=0;k<n;k++)
		for(int l=i;l<=j;l++)
			temp[k]+=a[l][k];
}
int solve()  //求一个序列的连续子序和最大值。
{
	dp[0]=temp[0];
	int maxx=dp[0];
	for(int i=1;i<n;i++)
	{
		if(dp[i-1]+temp[i]>=temp[i])
			dp[i]=dp[i-1]+temp[i];
		else dp[i]=temp[i];
		if(maxx<dp[i])maxx=dp[i];
	}
	return maxx;
}
int main()
{
    //ifstream cin("input.txt");
    cin>>n;
	for(int i=0;i<n;i++)
	for(int j=0;j<n;j++)
		cin>>a[i][j];
	int max=-0x3f3f3f3f;
	for(int i=0;i<n;i++)		//每两行都要求一下~
		for(int j=i;j<n;j++)
		{
		    memset(temp,0,sizeof(temp));
			add(i,j);//把第i列到第j列合并成一列，存在temp里
			int t=solve();
			if(max<t) max=t;
		}
    printf("%d\n",max);
	return 0;
}