To The Max(hdu-1081)

## 点击查看题目##

#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int ch[200][200];int main(){    int n,i,j,k,l,sum,max,s;    while(scanf("%d",&n)!=EOF&&n!=0)    {        for(i=1;i<=n;i++)            for(j=1;j<=n;j++)                scanf("%d",&ch[i][j]);        sum=max=0;        for(i=1;i<=n;i++)        {            for(j=i;j<=n;j++)            {                sum=0;                for(k=1;k<=n;k++)                {                    s=0;                    for(l=i;l<=j;l++)                        s+=ch[k][l];                    sum+=s;                    if(sum<0)sum=0;                    if(max<sum)max=sum;                }            }        }        cout<<max<<endl;    }    return 0;}