方格取数
思路
由题意可以想到用动态规划数组DP[i][j][k][l]表示走到A(i,j),B(k,l).
那么,对于某一步一共有四种情况:
- 路径A向右,路径B向下;
- 路径A向右,路径B向右;
- 路径A向下,路径B向右;
- 路径A向下,路径B向下。
得到动态转移方程:
同时注意题目要求:每个数字取一次,故在动态规划枚举的时候需要判重。
#include <iostream>
#include <algorithm>
using namespace std;
const int Max = 9;
int DP[Max+1][Max+1][Max+1][Max+1] = {0};
int Num[Max+1][Max+1] = {0};
int X,Y;
int main(void)
{
cin >> X;
Y = X;
int Tmp = 1;
while(Tmp)
{
int x,y;
cin >> x >> y >> Tmp;
Num[x][y] = Tmp;
}
for(int i = 1;i <= X;i++)
{
for(int j = 1;j <= Y;j++)
{
for(int k = 1;k <= X;k++)
{
for(int l = 1;l <= Y;l++)
{
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i][j-1][k][l-1]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i][j-1][k-1][l]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i-1][j][k][l-1]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i-1][j][k-1][l]);
if(i == k && j == l)
{
DP[i][j][k][l] += Num[i][j];
}
else
{
DP[i][j][k][l] += Num[i][j] + Num[k][l];
}
}
}
}
}
cout << DP[X][Y][X][Y] << endl;
return 0;
}
传纸条
思路
想法和 方格取数 一题类似;
区别:
1.两条路径不可重叠(同学不会帮你传两次,所以枚举 l 的时候从l = j+1开始,这样就避免的线路交叉)
2.由于右下角是传出点0,所以输出答案的时候要避开简单地输出DP[X][Y][X][Y]
#include <iostream>
#include <algorithm>
using namespace std;
const int Max = 50;
int DP[Max+1][Max+1][Max+1][Max+1] = {0};
int ClassRoom[Max+1][Max+1];
int X,Y;
int main(void)
{
cin >> X >> Y;
for(int i = 1;i <= X;i++)
{
for(int j = 1;j <= Y;j++)
{
cin >> ClassRoom[i][j];
}
}
for(int i = 1;i <= X;i++)
{
for(int j = 1;j <= Y;j++)
{
for(int k = 1;k <= X;k++)
{
for(int l = j+1;l <= Y;l++)
{
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i][j-1][k][l-1]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i][j-1][k-1][l]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i-1][j][k][l-1]);
DP[i][j][k][l] = max(DP[i][j][k][l],DP[i-1][j][k-1][l]);
DP[i][j][k][l] += ClassRoom[i][j] + ClassRoom[k][l];
}
}
}
}
//纸条1传到C(X,Y-1) 纸条2传到C(X-1,Y)所得到的最大值,这里是为了避开终点
cout << DP[X][Y-1][X-1][Y] << endl;
return 0;
}