原题:
描述 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.
-
输入
- 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. 输出
- Your program is to write to standard output. The highest sum is written as an integer. 样例输入
-
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
样例输出
-
30
#include<stdio.h>//4 240 时间 内存
int main() {
int n;
scanf("%d", &n);
int a[100][100] = { 0 };//把三角形看成题目数据那种类型的矩阵,空位用0补。
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
scanf("%d", &a[i][j]);
}
}
int dp[100][100] = { 0 };
dp[0][0] = a[0][0];
for (int i = 1; i < n; i++) {
//采用动态规划,保留最大值。注意三角形变换成矩阵后数据之间路线的加法
for (int j = 0; j < i +1; j++) {
int f = 0, h = 0;
if (j != 0) {
f = a[i][j] + dp[i - 1][j];
h = a[i][j] + dp[i - 1][j - 1];
dp[i][j] = f > h ? f : h;
}
else dp[i][j] = a[i][j] + dp[i - 1][j];
}
}
int max = a[n - 1][0];
for (int i = n - 1, j = 1; j < n; j++) {
if (dp[i][j] > max)max = dp[i][j];
}
printf("%d\n", max);
return 0;
}