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

152人阅读 评论(0)

## 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;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：151312次
• 积分：7523
• 等级：
• 排名：第3354名
• 原创：628篇
• 转载：7篇
• 译文：0篇
• 评论：23条
阅读排行
最新评论