题目描述
blablabla
样例
blablabla
算法
(向上dp) $O(n^2)$
java 代码
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
/**
* 5
* 7
* 3 8
* 8 1 0
* 2 7 4 4
* 4 5 2 6 5
* 1≤n≤500,
* −10000≤三角形中的整数≤10000
* @param args
*/
public static void main(String[] args) throws IOException {
int[][] triangle;
final int n;
try(BufferedReader bd = new BufferedReader(new InputStreamReader(System.in))){
n = Integer.parseInt(bd.readLine());
triangle = new int[n][n];
for (int i = 0; i < n; i++) {
String[] s = bd.readLine().split(" ");
for (int j = 0; j < s.length; j++) {
triangle[i][j] = Integer.parseInt(s[j]);
}
}
}
for (int i = n-2; i >= 0; i--) {
for (int j = 0; j <= i; j++) {
triangle[i][j] = triangle[i][j] + Math.max(triangle[i+1][j], triangle[i+1][j+1]);
}
}
System.out.println(triangle[0][0]);
}
}
blablabla