To the Max

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65411#problem/B

预处理sum数组记录a[1][1]到a[i][j]的矩阵的和在dp的时候使用。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
const int N = 110;

int a[N][N],sum[N][N];
int main(){
	int n;
	while(scanf("%d",&n) == 1){
		memset(sum, 0, sizeof(sum));
		for(int i=1; i<=n; i++){
			for(int j=1; j<=n; j++){
				scanf("%d",&a[i][j]);
				sum[i][j] = sum[i][j-1] + sum[i-1][j] + a[i][j] - sum[i-1][j-1];
			}
		}
		int ans = -1e9;
		for(int i=1; i<=n; i++){
			for(int j=i; j<=n; j++){
				for(int k=1, tmp=0; k<=n; k++){
					if(tmp > 0)	tmp += (sum[j][k] - sum[i-1][k]) - (sum[j][k-1] - sum[i-1][k-1]);
					else	tmp = (sum[j][k] - sum[i-1][k]) - (sum[j][k-1] - sum[i-1][k-1]);
					ans = max(ans, tmp);
				}
			}
		}
		printf("%d\n",ans);
	}
	///system("pause");
	return 0;
}