【noip2008】传纸条

题目

洛谷1006

题解

设f[i][j][k][l]为从小渊传到小轩的纸条到达(i,j)，从小轩传给小渊的纸条到达(k,l)的路径上取得的最大的好心程度和。
那么显然，转移方程是 f[i][j][k][l]=max( f[i][j-1][k-1][l] , f[i-1][j][k][l-1] , f[i][j-1][k][l-1] , f[i-1][j][k-1][l] )+a[i][j]+a[k][l]。
由于终点的值是0，所以目标状态就是f[n][m-1][n-1][m]。

code

#include <bits/stdc++.h>
#define fup(i, a, b) for(int i = a; i <= b; ++i) 
#define fdown(i, a, b) for(int i = a; i >= b; --i)
#define pri_(k) printf("%d ", k)
#define pri(k) printf("----%d---\n", k)
const int maxn = 70;
const int inf = 0x3f3f3f3f;
typedef long long ull;

namespace millope {
    inline void kswap(int &a, int &b) { a ^= b ^= a ^= b; }
    inline int kmin(int a, int b) { return a > b ? b : a; }
    inline int kmax(int a, int b) { return a > b ? a : b; }
    inline int read() {
        int s = 0, w = 1;
        char ch = getchar();
        while (!isdigit(ch)) { if (ch == '-') w = -1; ch = getchar(); }
        while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
        return s * w;
    }
}
using namespace millope;
using namespace std;

int m;
int n;
int lov[maxn][maxn];
int f[maxn][maxn][maxn][maxn];

int main() {
	n = read(), m = read();
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			lov[i][j] = read();
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			for (int k = 1; k <= n; ++k) {
				for (int l = j + 1; l <= m; ++l) {
					int x = kmax(f[i][j - 1][k - 1][l], f[i - 1][j][k][l - 1]);
					int y = kmax(f[i][j - 1][k][l - 1], f[i - 1][j][k - 1][l]);
					f[i][j][k][l] = kmax(x, y) + lov[i][j] + lov[k][l];
				}
			}
		}
	}
	printf("%d\n", f[n][m - 1][n - 1][m]);
	return 0;
}