hdu1081 最大子矩阵和(DP动态规划 最大子序列和变形题)

To The Max

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

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
  
  

题目大意:

给定一个矩阵，选取一个子矩阵，这个子矩阵是所有子矩阵中和最大的那一个，输出最大的和.

解题思路:

把二维化一维，化作DP求最大子序列的那种做法

AC代码:

#include<iostream>

using namespace std;

const int maxn = 105;
int mat[maxn][maxn];
int dp[maxn][maxn];
int g[maxn];
const int inf = 0x3f3f3f3f;

int main()
{
	int m;
	int i,j;
	//freopen("1.txt","r",stdin);
	while(scanf("%d",&m) != EOF)
	{
		for(i=0;i<=m;i++)
		{
			dp[i][0] = dp[0][i] = mat[0][i] = mat[i][0] = 0;
		}
		for(i=1;i<=m;i++)
		{
			for(j=1;j<=m;j++)
			{
				scanf("%d",&mat[i][j]);
				dp[i][j] = dp[i-1][j] + mat[i][j];
			}
		}
		int k;
		int Max = -inf;
		for(i=1;i<=m;i++)
		{
			for(j=i;j<=m;j++)
			{
				int ans = 0;
				for(k=1;k<=m;k++)
				{
					g[k] = dp[j][k] - dp[i][k];
					if(ans < 0)
					{
						ans = 0;
					}
					ans += g[k];
					if(ans > Max)
					{
						Max = ans;
					}
				}
			}
		}
		printf("%d\n",Max);
	}
	return 0;
}