方格取数代码
#include <iostream>
using namespace std;
const int N = 11;
int n;
int w[N][N];
int f[N * 2][N][N];
int main()
{
cin >> n;
int a, b, c;
while (cin >> a >> b >> c, a || b || c) w[a][b] = c;
for (int k = 2; k <= n * 2; k++)
for (int i1 = 1; i1 <= n; i1++)
for (int i2 = 1; i2 <= n; i2++)
{
int j1 = k - i1, j2 = k - i2;
if (j1 >= 1 && j1 <= n && j2 >= 1 && j2 <= n)
{
int t = w[i1][j1];
if (i1 != i2) t += w[i2][j2];
int &x = f[k][i1][i2];
x = max(x, f[k - 1][i1 - 1][i2 - 1] + t);
x = max(x, f[k - 1][i1 - 1][i2] + t);
x = max(x, f[k - 1][i1][i2 - 1] + t);
x = max(x, f[k - 1][i1][i2] + t);
}
}
cout << f[n + n][n][n];
}
传纸条代码
#include <iostream>
using namespace std;
const int N = 55;
int n, m;
int s[N][N];
int f[N * 2][N][N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> s[i][j];
for (int k = 2; k <= n + m; k++)
for (int i1 = 1; i1 <= n; i1++)
for (int i2 = 1; i2 <= n; i2++)
{
int j1 = k - i1, j2 = k - i2;
if (j1 >= 1 && j1 <= m && j2 >= 1 && j2 <= m)
{
if (i1 != i2 || k == 2 || k == n + m)
{
int t = s[i1][j1] + s[i2][j2];
int &x = f[k][i1][i2];
x = max(x, f[k - 1][i1][i2] + t);
x = max(x, f[k - 1][i1 - 1][i2 - 1] + t);
x = max(x, f[k - 1][i1][i2 - 1] + t);
x = max(x, f[k - 1][i1 - 1][i2] + t);
}
}
}
cout << f[n + m][n][n];
}
方格取数中没有限制前后两种路线不能走到同一位置,而传纸条限制了两条路线不能走到同一位置
在方格取数的代码中实现了可能出现两条路线走进同一格,而传纸条中将两条路线走进同一格这种情况排除了
代码可以通用的原因是方格取数中没有数据可以卡掉
但题解区似乎已经有证明两条路线不会有交叉