原题1网址P1006 [NOIP2008 提高组] 传纸条
原题2网址P1004 [NOIP2000 提高组] 方格取数
假设先求从(0,0)到(n,m)或(n,n), 直接用动态dp即可,其动态转移方程为:
dp[i][j] = max(dp[i][j-1], dp[i-1][j]) + g[i][j];而现在还要走回来, 也就等价于在走一回,解法有很多:
1.分开算: 将第一次走的dp路回溯,赋值成0,再次dp 即可;
2.一起算:用4维数组直接同时走两条路过去,走到同一点时, 只取一次值,即可;其转移方程:
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 ++){
int one = max(dp[i-1][j][k-1][l], dp[i-1][j][k][l-1]);
int tow = max(dp[i][j-1][k-1][l], dp[i][j-1][k][l-1]);
dp[i][j][k][l] = max(one, tow) + g[i][j] + g[k][l];
if(i == k || j == l) dp[i][j][k][l] -= g[i][j]; // 只取一次值, 防止重复
}
}
}
}
两个题解代码:
/*
https://www.luogu.com.cn/problem/P1004
P1004 [NOIP2000 提高组] 方格取数
*/
#include<bits/stdc++.h>
using namespace std;
int g[11][11];
int dp[11][11][11][11];
int main() {
int n;
cin >> n;
int a, b, c;
while(true){
if(!a && !b && !c) break;
cin >> a >> b >> c;
g[a][b] = c;
}
memset(dp, 0, sizeof(dp));
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= n; j ++){
for(int k = 1; k <= n; k ++){
for(int l = 1; l <= n; l ++){
int one = max(dp[i-1][j][k-1][l], dp[i-1][j][k][l-1]);
int tow = max(dp[i][j-1][k-1][l], dp[i][j-1][k][l-1]);
dp[i][j][k][l] = max(one, tow) + g[i][j] + g[k][l];
if(i == k && j == l) dp[i][j][k][l] -= g[i][j];
}
}
}
}
cout << dp[n][n][n][n] << endl;
return 0;
}
/*
https://www.luogu.com.cn/problem/P1004
P1004 [NOIP2000 提高组] 方格取数
*/
#include<bits/stdc++.h>
using namespace std;
int g[55][55];
int dp[55][55][55][55];
int main() {
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= m; j ++){
cin >> g[i][j];
}
}
memset(dp, 0, sizeof(dp));
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 ++){
int one = max(dp[i-1][j][k-1][l], dp[i-1][j][k][l-1]);
int tow = max(dp[i][j-1][k-1][l], dp[i][j-1][k][l-1]);
dp[i][j][k][l] = max(one, tow) + g[i][j] + g[k][l];
if(i == k || j == l) dp[i][j][k][l] -= g[i][j];
}
}
}
}
cout << dp[n][m][n][m] << endl;
return 0;
}