poj1050 To the Max

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int a[101][101];
int f[101],ff[101];
int main(){
	int n;
	int i,j,r;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			scanf("%d",&a[i][j]);
	int maxx=0;
	for(i=1;i<=n;i++){
		memset(f,0,sizeof(f));
		for(j=i;j<=n;j++){
			for(r=1;r<=n;r++)
				f[r]+=a[j][r];
			memset(ff,0,sizeof(ff));
			ff[1]=f[1];
			for(r=2;r<=n;r++)
				if(ff[r-1]>0)
					ff[r]=ff[r-1]+f[r];
				else
					ff[r]=f[r];
			for(r=1;r<=n;r++)
				if(ff[r]>maxx)
					maxx=ff[r];
		}
	}
	printf("%d\n",maxx);
	return 0;
}