The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 54244 | Accepted: 32730 |
Description
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
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
考点:动态规划
#include<bits/stdc++.h>
using namespace std;
int dp[110][110];
int main()
{
int n;
while(cin >> n)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=i; j++)
cin >> dp[i][j];
}
for(int i=n-1; i>=1; i--)
{
for(int j=1; j<=i; j++)
{
dp[i][j] = max(dp[i+1][j],dp[i+1][j+1]) + dp[i][j];
//某一数字的最大路线和 = max {左下角数字最大路线和,右下角数字最大路线和} + 该数字值
}
}
cout << dp[1][1] << endl;
}
return 0;
}