HDU 1081 最大子矩阵（LCS_DP+前缀和）

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
  
  

 

暴力枚举行的组成...即可。。 化二维—>一维

.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int inf=0x3f3f3f3f;
int pre[111][111],a[111][111],dp[111],b[111];
int main()
{
	int n,i,j,ans,k;
	
	while(scanf("%d",&n)!=EOF) {
		ans=-inf;
		memset(pre,0,sizeof(pre));
	
	for(i=1;i<=n;i++) {
		for(j=1;j<=n;j++)
		scanf("%d",&a[i][j]);
	}
	for(j=1;j<=n;j++) {
		for(i=1;i<=n;i++)
		pre[i][j]=pre[i-1][j]+a[i][j];
	
	}
	for(i=1;i<=n;i++) {
		for(j=i;j<=n;j++) {
			for(k=1;k<=n;k++) {
				b[k]=pre[j][k]-pre[i-1][k];
				dp[k]=0;
			}
			for(k=1;k<=n;k++) {
				dp[k]=max(dp[k-1],0)+b[k];
				ans=max(ans,dp[k]);
			}
		}
	}
	printf("%d\n",ans);
	}
	return 0;
}