1081 To The Max【最大子矩阵】

To The Max

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 10111    Accepted Submission(s): 4868

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
  
  

压缩枚举矩阵，然后动态更新最大值，求得最大子矩阵的和.......

#include<stdio.h>
#include<string.h>
#define maxn 0x3f3f3f3f
int x[105][105],n;
int sum(int i,int j)//动态
{
	int max=-maxn,tp=0;
	for(int k=1;k<=n;++k)
	{
		tp+=(x[j][k]-x[i][k]);
		if(tp>max)
		{
			max=tp;
		}
		if(tp<0)
		{
			tp=0;
		}
	}
	return max;
}

void slove()
{
	int max=-maxn;
	for(int i=0;i<n;++i)//双循环枚举矩阵
	{
		for(int j=i+1;j<=n;++j)
		{
			int tp=sum(i,j);
			if(tp>max)
			{
				max=tp;
			}
		}
	}
	printf("%d\n",max);
}
int main()
{
	while(~scanf("%d",&n))
	{
		memset(x,0,sizeof(x));
		for(int i=1;i<=n;++i)
		{
			for(int j=1;j<=n;++j)
			{
				int tp; 
				scanf("%d",&tp);
				x[i][j]=x[i-1][j]+tp;//预处理
			}
		}
		slove();
	}
	return 0;
}