洛谷刷题小记——P1216 [USACO1.5][IOI1994]数字三角形 Number Triangles

一、题目 

二、CODE 

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int r = sc.nextInt();

        short[][] arr = new short[r + 1][r + 1];
        for (int i = 1; i <= r; i++) {
            for (int j = 1; j <= i; j++) {
                arr[i][j] = sc.nextShort();
            }
        }

        int[] dp = new int[r + 1];
        dp[1] = arr[1][1];
        int ans = 0;
        for (int i = 2; i <= r; i++) {
            for (int j = i; j >= 1; j--) {
                dp[j] = Math.max(dp[j], dp[j - 1]) + arr[i][j];
                ans = Math.max(dp[j], ans);
            }
        }
        System.out.println(ans);
    }
}