蓝桥杯算法提高VIP-夺宝奇兵 （Java代码）

解题思路:一波深搜猛如虎，结果gp了，超时

哈哈

注意事项:

参考代码:

import java.util.Scanner;

public class Main {

private static int[][] a;

private static int[][] b=new int[][]{{1,1},{1,0}};

private static int m;

private static int max=0;

private static int[][] v=new int[1000][1000];

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

m=input.nextInt();

a=new int[m+1][m+1];

for (int i = 0; i <=m; i++) {

for (int j = i; j >0; j--) {

a[i][j]=input.nextInt();

}

}

dfs(1,1,a[1][1]);

System.out.println(max);

}

private static void dfs(int x, int y,  int mun) {

if(x==m){

if(mun>max)max=mun;

return;

}else{

for (int i = 0; i < 2; i++) {

int x1=x+b[i][0];

int y1=y+b[i][1];

if(y1>=1&&v[x1][y1]==0){

v[x1][y1]=1;

dfs(x1,y1,mun+a[x1][y1]);

v[x1][y1]=0;

}

}

}

}

}