方格取数
- 两个人必须同时走
- 数据量最大为10,可以用四维dp
- dp[i][j][k][l]表示两个人分别走到(i,j),(k,l)时取得的数的最大和
- 转移方程 —— dp[i,j,k,l]=max(dp[i-1,j,k-1,l],dp[i-1,j,k,l-1],dp[i,j-1,k-1,l],dp[i,j-1,k,l-1])+(i == k && j == l ? num[i][j] : num[i][j] + num[k][l])
- 初始化按题意,其余为0
import java.util.Scanner;
public class Main {
public static int[][] map = new int[11][11];
public static int [][][][] dp = new int[11][11][11][11];
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int n, m ,num;
while(true)
{
n = sc.nextInt();
m = sc.nextInt();
num = sc.nextInt();
if(n == 0 && m == 0 && num == 0) break;
map[n][m] = num;
}
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++){
dp[i][j][k][l] = Math.max(Math.max(dp[i-1][j][k-1][l],dp[i-1][j][k][l-1]),Math.max(dp[i][j-1][k-1][l],dp[i][j-1][k][l-1]))+((i==k && j==l) ? map[i][j] : map[i][j]+map[k][l]);
}
}
}
}
System.out.println(dp[N][N][N][N]);
}
}
传纸条
import java.util.Scanner;
public class Main {
public static int[][] map = new int[51][51];
public static int [][][][] dp = new int[51][51][51][51];
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
for(int i = 0;i<m;i++){
for(int j = 0;j<n;j++){
map[i][j] = sc.nextInt();
}
}
for(int i = 1;i<=m;i++){
for(int j = 1;j<=n;j++){
for(int k = 1;k<=m;k++){
for(int l = 1;l<=n;l++){
dp[i][j][k][l] = Math.max(Math.max(dp[i-1][j][k-1][l],dp[i-1][j][k][l-1]),Math.max(dp[i][j-1][k-1][l],dp[i][j-1][k][l-1]))+((i==k && j==l) ? map[i-1][j-1] : map[i-1][j-1]+map[k-1][l-1]);
}
}
}
}
System.out.println(dp[m][n][m][n]);
}
}