【题目链接】
【思路要点】
- 把字符画从左到右分成若干个阶段,记录上一列的内容,按列DP即可。
- 多数转移都比较显然,在N中部处的转移需要用到一定的前缀最大值的技巧。
- 时间复杂度\(O(N^2M)\),常数较大。
【代码】
#include <bits/stdc++.h> using namespace std; const int MAXN = 155; const int MAXM = 505; const int INF = 0x3f3f3f3f; const int STATES = 12; template <typename T> void chkmax(T &x, T y) {x = max(x, y); } template <typename T> void chkmin(T &x, T y) {x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - '0'; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar('-'); if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template <typename T> void writeln(T x) { write(x); puts(""); } int n, m, x[MAXN][MAXM]; int dp[3][STATES][MAXN][MAXN], Sum[MAXM][MAXN], Max[MAXN]; int main() { read(n), read(m); for(int i = n; i >= 1; i--) for(int j = 1; j <= m; j++) read(x[i][j]); for(int i = 1; i <= m; i++) for(int j = 1; j <= n; j++) Sum[i][j] = Sum[i][j - 1] + x[j][i]; int ans = -INF; memset(dp, -INF, sizeof(dp)); for(int i = 1; i <= m; i++) { int c = i % 3, f = (i - 1) % 3, t = (i + 1) % 3; memset(dp[t], -INF, sizeof(dp[0])); for(int l = 1; l <= n; l++) for(int r = l; r <= n; r++) { int s1 = Sum[i][r] - Sum[i][l-1] , s2 = x[l][i] + x[r][i]; dp[c][0][l][r] = max(dp[f][0][l][r], 0) + s1; if(r - l < 2) continue; dp[c][4][l][r] = dp[f][3][0][0] + s1; dp[c][6][l][r] = dp[f][5][l][r] + s1; dp[c][5][l][r] = max(dp[f][4][l][r], dp[f][5][l][r]) + s2; dp[c][8][l][r] = max(dp[f][8][l][r], dp[f][7][0][0]) + s2; dp[c][9][l][r] = max(dp[f][9][l][r], dp[f][8][l][r]) + s1; dp[c][10][l][r] = max(dp[f][10][l][r], dp[f][9][l][r]) + s2; chkmax(ans, dp[c][10][l][r]); chkmax(dp[t][7][0][0], dp[c][6][l][r]); } chkmax(dp[c][3][0][0], dp[f][3][0][0]); chkmax(dp[c][7][0][0], dp[f][7][0][0]); memset(Max, -INF, sizeof(Max)); for(int r = n; r; r--) { for(int j = 1; j <= n; j++) chkmax(Max[j], dp[f][1][j][r]); for(int l = r, now = Max[r + 1]; l; l--) { chkmax(now, Max[l]); dp[c][1][l][r] = max(dp[f][1][l][r], now) + Sum[i][r] - Sum[i][l-1]; } for(int l = 1, now = -INF; l <= r; l++) { chkmax(dp[c][1][l][r], now + Sum[i][r] - Sum[i][l-1]); chkmax(now, dp[f][0][l][r]); } } for(int l = 1; l <= n; l++) for(int r = l, now = -INF; r <= n; r++) { dp[c][2][l][r] = max(dp[f][2][l][r], now) + Sum[i][r] - Sum[i][l-1]; chkmax(dp[t][3][0][0], dp[c][2][l][r]); chkmax(now, dp[f][1][l][r]); } } writeln(ans); return 0; }