ZOJ 1074 To the Max

最大矩阵和问题，简单DP

<!--<br /> <br /> Code highlighting produced by Actipro CodeHighlighter (freeware)<br /> http://www.CodeHighlighter.com/<br /> <br /> -->
#include<iostream>
#include<limits>
usingnamespacestd;

constintMAXSIZE=100;
inta[MAXSIZE][MAXSIZE],b[MAXSIZE],n;

intmaxSubArray()
{//计算最大子序列和
intcurSum=0,sum=numeric_limits<int>::min();
for(inti=0;i<n;i++)
{
if(curSum>0)
curSum+=b[i];
else
curSum=b[i];
if(curSum>sum)
sum=curSum;
}
returnsum;
}
intmaxSubMatrix()
{//计算最大子矩阵和
inti,j,k,curSum=0,sum=numeric_limits<int>::min();
for(i=0;i<n;i++)
{
for(k=0;k<n;k++)//初始化b[]
{
b[k]=0;
}
for(j=i;j<n;j++)//把第i行到第j行相加,对每一次相加求出最大值
{
for(k=0;k<n;k++)
{
b[k]+=a[j][k];
}
curSum=maxSubArray();
if(curSum>sum)
{
sum=curSum;
}
}
}
returnsum;
}

intmain(void)
{
cin>>n;
inti,j;
//输入矩阵
for(i=0;i<n;++i)
{
for(j=0;j<n;++j)
{
cin>>a[i][j];
}
}
cout<<maxSubMatrix()<<endl;
return0;
}