[IOI 1994] 数字三角形 Number Triangles Java

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int r = sc.nextInt();
		int[][] dp = new int[r + 1][r + 1];
		for (int i = 1; i <= r; i++) {
			for (int j = 1; j <= i; j++) {
				int n = sc.nextInt();
				dp[i][j] = Math.max(dp[i - 1][j - 1], dp[i - 1][j]) + n;
				// 每次从左上方和右上方中找出最大值，最后加上当前位置的数字
			}
		}
		sc.close();
		int max = Integer.MIN_VALUE;
		for (int i = 1; i <= r; i++) max = Math.max(max, dp[r][i]);
		System.out.println(max);
	}
}

每日一水~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~