POJ 1163 The Triangle
2017-08-19 11:34
309 查看
Description
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
Input
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
Sample Output
Code
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
Input
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Sample Output
30
Code
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] data = new int ; for (int i = 0; i < n; i++) for (int j = 0; j <= i; j++) { data[i][j] = sc.nextInt(); } int[] dp = data[n - 1]; for (int i = n - 2; i >= 0; i--) for (int j = 0; j <= i; j++) { dp[j] = Math.max(dp[j], dp[j + 1]) + data[i][j]; } System.out.println(dp[0]); sc.close(); } }
相关文章推荐
- poj 1163 The Triangle
- (转)POJ 1163 The Triangle 解题报告
- poj 1163 the triangle(dp)
- POJ 1163 The Triangle
- POJ 1163 The Triangle【DP】
- poj 1163 The Triangle (动态规划)
- poj 1163 The Triangle
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- poj 1163 The Triangle
- poj 1163 The Triangle
- POJ 1163 The Triangle
- The Triangle--poj--1163
- poj1163 The Triangle ——DP入门题
- POJ1163-The Triangle-动态规划
- POJ1163-The Triangle
- poj1163——The Triangle(简单dp)
- 【原】 POJ 1163 The Triangle 三角形最大路径 动态规划 解题报告
- POJ 1163 The Triangle
- poj 1163 The Triangle