NYOJ 18. The triangle（基础DP）

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

【分析】基础DP。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=105;
int n;
int a[maxn][maxn];
int dp[maxn][maxn];   //dp[i][j]记录从三角形(i,j)点出发到底层，路径上的最大元素和
int main()
{
    int i,j;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        for(j=1;j<=i;j++)
            scanf("%d",&a[i][j]);
    memset(dp,0,sizeof(dp));
    for(i=1;i<=n;i++)    //填三角形底层
        dp[n][i]=a[n][i];
    for(i=n-1;i>=1;i--)  //自底向上确定dp[i][j]
        for(j=1;j<=i;j++)
            dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
    printf("%d\n",dp[1][1]);
    return 0;
}