# POJ 1163

208人阅读 评论(0)

## 初入dp，第一道dp题

Description

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

AC代码：

import java.util.Scanner;

public class Main {
private static int num = 0;
private static int[][] dp = new int[200][200];
private static int[][] memory = new int[200][200];

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
num = scanner.nextInt();
for (int i = 1; i <= num; i++) {
for (int j = 1; j <= i; j++) {
memory[i][j] = scanner.nextInt();
}
}
for (int i = 1; i <= num; i++) {
for (int j = 1; j <= i; j++) {
if (i == 1) {
dp[i][j] = memory[i][j];
} else if (j == 1) {
dp[i][j] = dp[i - 1][j] + memory[i][j];
} else if (j == i) {
dp[i][j] = dp[i - 1][j - 1] + memory[i][j];
} else {
dp[i][j] = getMax(dp[i - 1][j], dp[i - 1][j - 1])
+ memory[i][j];
}
}
}
int result =0;
for (int i = 1; i <= num; i++)
result = getMax(result, dp[num][i]);
System.out.println(result);
scanner.close();
}

private static int getMax(int x, int y) {
if (x > y) {
return x;
}
return y;
}
}



*最后根据结果来分析一下:

5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5

7
10 15
18 16 15
20 25 20 19
24 30 27 26 24


0
0

个人资料
• 访问：112172次
• 积分：1387
• 等级：
• 排名：千里之外
• 原创：41篇
• 转载：3篇
• 译文：0篇
• 评论：32条
博客专栏
 数据结构与算法 文章：0篇 阅读：0
 android 学习 文章：11篇 阅读：28405
最新评论