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.
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
这道题是由最大字段和问题延伸而来,最大子段和问题是一维,而这道题是二维。
所以想办法把它降为一维。然后发现上下相加不就成为一维的嘛。
然后遍历一下,让所有情况都计算一下,得出最大值;
详细参考:http://blog.csdn.net/beiyeqingteng/article/details/7056687
代码:
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int dp[102][102];
//最大子段和问题,算出一维的最大
int maxsub(int n,int a[])
{
int i,sum=0,b=0;
for(i=1; i<=n; i++)
{
if(b>0)b+=a[i];
else b=a[i];
if(b>sum)sum=b;
}
return sum;
}
int main()
{
int b[102];
int n,i,k,j,sum,maxsum;
while(scanf("%d",&n)!=EOF)
{
//存图
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
scanf("%d",&dp[i][j]);
}
}
//将二维压至一维
maxsum=0;
for(i=1; i<=n; i++)//用来遍历所有的情况
{
//b是用来存入上下和的值
memset(b,0,sizeof(b));
for(j=i; j<=n; j++)//行
{
for(k=1; k<=n; k++)//列
{
b[k]+=dp[j][k];
}
sum=maxsub(n,b);
if(sum>maxsum)maxsum=sum;
}
}
printf("%d\n",maxsum);
}
return 0;
}