P1719 最大加权矩形(朴素前缀和or压缩维度线性dp）

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int n;
int a[150][150];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			scanf("%d", &a[i][j]);
			a[i][j] += a[i - 1][j];
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int k = i + 1; k <= n; k++) {
			int dp[150] = {0};
			for (int j = 1; j <= n; j++) {
				int t = a[k][j] - a[i][j];
				dp[j] = max(dp[j - 1] + t, t);
				ans = max(dp[j], ans);
			}
		}
	}
	printf("%d", ans);
	return 0;
}