http://codevs.cn/problem/1169/
一开始看到两条路线DP,一下子就懵了,先找一条路线,限制了下一条线的方法,肯定是不行的。很无语的看了题解,发现是一个4维数组的动态规划,慢慢的有了点思路。
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int dp[51][51][51][51] = { 0 };
int max(int a, int b)
{
if (a>b)
return a;
else
return b;
}
int main()
{
int ditu[60][60] = { 0 };
int n, m;
cin >> n >> m;
for (int i = 1; i <=n; i++)
{
for (int j = 1; j <= m; j++)
scanf_s("%d",&ditu[i][j]);
}
for (int i = 1; i <=n; i++)
{
for (int j = 1; j <= m; j++)
{
for (int k = 1; k <=n; k++)
{
for (int l= 1; l <=m; l++)
{
if (i == k || j == l)
continue;
dp[i][j][k][l] = ditu[i][j] + ditu[k][l] + max(max(dp[i - 1][j][k - 1][l], dp[i - 1][j][k][l - 1]), max(dp[i][j - 1][k - 1][l], dp[i][j - 1][k][l - 1]));
}
}
}
}
cout << max(dp[n-1][m][n][m-1],dp[n][m-1][n-1][m])+ditu[n][m] << endl;
system("pause");
return 0;
}
(DP 感觉好难,但现在做题还是没有感觉)