package dp.code.数字三角形NumberTriangles;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int[] dp = new int[1005];
// 思路: 用一维数组,记录每次状态的最优值
Scanner cnt = new Scanner(System.in);
int N = cnt.nextInt();
int num;
for (int sc = 1; sc <= N; sc++) {
for (int i = sc; i >= 1; i--) { // 后面往前更新,不然会打乱
num = cnt.nextInt();
dp[i] = Math.max(dp[i], dp[i - 1]) + num;
}
}
int max = 0;
for (int i = 1; i <= N; i++) {
if (dp[i] > max) max = dp[i];
}
System.out.println(max);
}
}// 方小黑
刷刷水题, 消除恐惧