#include <cstdio> #include <algorithm> using namespace std; const int maxn = 16; int n, a[maxn][maxn], dp[maxn][maxn][maxn][maxn] = {0};//dp:一个人走到(i, j),一个人走到(k, l)的最大值 int main() { scanf("%d", &n); int i, j, k, l; int r, c, v; while(scanf("%d %d %d", &r, &c, &v) && r && c && v) a[r][c] = v; for(i = 1; i <= n; ++i) for(j = 1; j <= n; ++j) for(k = 1; k <= n; ++k) for(l = 1; l <= n; ++l) { int tmp1 = max(dp[i-1][j][k-1][l], dp[i-1][j][k][l-1]); int tmp2 = max(dp[i][j-1][k-1][l], dp[i][j-1][k][l-1]); dp[i][j][k][l] = max(tmp1, tmp2) + a[i][j];//找到上一个时刻的最值 if(i != k && j != l) dp[i][j][k][l] += a[k][l];//如果(i, j)!=(k, l) } printf("%d\n", dp[n][n][n][n]); return 0; }
洛谷P1004_四维dp模板
猜你喜欢
转载自blog.csdn.net/jay__bryant/article/details/80114163
今日推荐
周排行