###### playboy307

Java，golang后台开发，欢迎互相交流学习

## The Triangle

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>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAX 210
int dp[MAX][MAX];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
scanf("%d",&dp[i][j]);
}
for(int i=n-1;i>=1;i--)
{
for(int j=1;j<=n;j++)
dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]);
}
printf("%d\n",dp[1][1]);
}
return 0;
}


#### DP 水题

2014-11-17 20:38:21

#### DP Triangle

2015-05-15 20:21:11

#### hdu 2569 彼岸 dp水题

2013-06-13 15:59:26

#### 期望dp的水题

2017-06-08 15:20:31

#### NYOJ-18-The Triangle（动态规划）

2016-07-22 08:45:56

#### 题目推荐—BZOJ 水题推荐

2013-07-16 15:26:44

#### poj 动态规划DP - 1163 The Triangle

2015-04-26 22:26:25

#### The Triangle（简单DP）

2015-07-18 16:11:31

#### POJ 1163 The Triangle DP题解

2014-08-06 10:22:37

#### DP两道hdoj关于序列的水题hdoj1087,1159

2015-06-01 19:23:57

## 不良信息举报

nyoj--18--The Triangle(dp水题)