题目
求两条互不重合的最长路。
分析
dp
状态转移方程:
f
[
i
]
[
j
]
[
k
]
[
p
]
=
m
a
x
(
f
[
i
−
1
]
[
j
]
[
k
−
1
]
[
p
]
,
f
[
i
−
1
]
[
j
]
[
k
]
[
p
−
1
]
,
f
[
i
]
[
j
−
1
]
[
k
−
1
]
[
p
]
,
f
[
i
]
[
j
−
1
]
[
k
]
[
p
−
1
]
)
+
a
[
i
]
[
j
]
+
a
[
k
]
[
p
]
f[i][j][k][p]=max(f[i-1][j][k-1][p],f[i-1][j][k][p-1],f[i][j-1][k-1][p],f[i][j-1][k][p-1])+a[i][j]+a[k][p]
f[i][j][k][p]=max(f[i−1][j][k−1][p],f[i−1][j][k][p−1],f[i][j−1][k−1][p],f[i][j−1][k][p−1])+a[i][j]+a[k][p]
最后输出
f
[
n
]
[
m
−
1
]
[
n
−
1
]
[
m
]
f[n][m-1][n-1][m]
f[n][m−1][n−1][m]就好了。
代码
#include <cstdio>
#include <algorithm>
#include <cctype>
using namespace std;
int n,m,a[51][51],f[51][51][51][51];
int in(){
int ans=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=ans*10+c-48,c=getchar();
return ans;
}
int main(){
n=in(); m=in();
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++) a[i][j]=in();
for (int i=1;i<=n;i++)
for (int j=1;j<m;j++)
for (int k=1;k<=n;k++)
for (int p=j+1;p<=m;p++)//关键,为了避免重合
f[i][j][k][p]=max(max(f[i][j-1][k-1][p],f[i-1][j][k][p-1]),max(f[i][j-1][k][p-1],f[i-1][j][k-1][p]))+a[i][j]+a[k][p];//动态规划
printf("%d",f[n][m-1][n-1][m]);
return 0;
}
#分析(2)
其实也可以使用三维dp,因为它们的步数是一样的。
f
[
k
]
[
i
]
[
j
]
=
m
a
x
(
f
[
k
−
1
]
[
i
]
[
j
]
,
f
[
k
−
1
]
[
i
−
1
]
[
j
−
1
]
,
f
[
k
−
1
]
[
i
−
1
]
[
j
]
,
f
[
k
−
1
]
[
i
]
[
j
−
1
]
)
+
a
[
i
]
[
k
−
i
+
1
]
+
a
[
j
]
[
k
−
j
+
1
]
f[k][i][j]=max(f[k-1][i][j],f[k-1][i-1][j-1],f[k-1][i-1][j],f[k-1][i][j-1])+a[i][k-i+1]+a[j][k-j+1]
f[k][i][j]=max(f[k−1][i][j],f[k−1][i−1][j−1],f[k−1][i−1][j],f[k−1][i][j−1])+a[i][k−i+1]+a[j][k−j+1]
#代码
#include <cstdio>
#include <algorithm>
#include <cctype>
using namespace std;
int n,m,a[51][51],f[101][51][51];
int in(){
int ans=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=ans*10+c-48,c=getchar();
return ans;
}
int main(){
n=in(); m=in();
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++) a[i][j]=in();
for (int k=1;k<n+m;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++){
if (k-i+1<1||k-j+1<1) continue;//走不了
f[k][i][j]=max(max(f[k-1][i][j],f[k-1][i-1][j-1]),max(f[k-1][i][j-1],f[k-1][i-1][j]))+a[i][k-i+1]+a[j][k-j+1];//动态规划
if (i==j) f[k][i][j]-=a[i][k-i+1];//走到相同的地方
}
printf("%d",f[n+m-1][n][n]);
return 0;
}