pku1050 To the Max DP

最小矩阵和 太久没写了纠结了好久该怎么统计，然后发现自己SB了

Problem: 1050		User: BPM136
Memory: 788K		Time: 0MS
Language: G++		Result: Accepted

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define LL long long
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define down(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline LL read()
{
	LL d=0,f=1;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
	return d*f;
}
#define N 105
int a[N][N];
int sum[N][N];
int n;

int main()
{
	n=read();memset(sum,0,sizeof(sum));
	fo(i,1,n)
	{
		fo(j,1,n)
		a[i][j]=read();
	}
	fo(i,1,n)
	{
		fo(j,1,n)
		{
			sum[i][j]=sum[i][j-1]+a[i][j];
		}
	}
	int ans=0;
	fo(i,1,n)
	{
		fo(j,i,n)
		{
			int t=0,anss=0;
			fo(k,1,n)
			{
				t+=sum[k][j]-sum[k][i-1];
				if(t<0)t=0;
				anss=max(anss,t);
			}
			ans=max(ans,anss);
		}
	}
	cout<<ans<<endl;
	return 0;
}