poj1050最大矩阵和——暴力枚举

#include<iostream>
#include<cstdio>
using namespace std;
int n,a[105][105],s[105][105],ans;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			scanf("%d",&a[i][j]);
			s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
		}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			for(int k=i;k<=n;k++)
				for(int l=j;l<=n;l++)
					if(s[k][l]-s[i-1][l]-s[k][j-1]+s[i-1][j-1]>ans)
						ans=s[k][l]-s[i-1][l]-s[k][j-1]+s[i-1][j-1];
	printf("%d",ans);
	return 0;
}