The Triangle
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
4
-
描述
-
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
01.
#include<iostream>
02.
#include<algorithm>
03.
using
namespace
std;
04.
int
dp[101][101];
05.
int
main()
06.
{
07.
int
n;
08.
cin>>n;
09.
for
(
int
i=1;i<=n;i++)
10.
for
(
int
j=1;j<=i;j++)
11.
{
12.
cin>>dp[i][j];
13.
dp[i][j]+=max(dp[i-1][j-1],dp[i-1][j]);
14.
}
15.
cout<<*max_element(dp[n],dp[n]+n)<<endl;
16.
return
0;
17.
}