POJ - 1163 The Triangle (动态规划)

最新推荐文章于 2020-10-04 20:41:55 发布

原创最新推荐文章于 2020-10-04 20:41:55 发布 · 178 阅读

1 ·

CC 4.0 BY-SA版权

ACM-ICPC 专栏收录该内容

20 篇文章

订阅专栏

博客给出了POJ-1163数字三角形问题的题目描述，包括从顶部到底部路径数字最大和的规则，以及输入输出要求，如输入行数和三角形数据，输出最大和。最后给出了该题的AC代码。

题目链接 https://vjudge.net/problem/POJ-1163

题目

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.

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

Sample Output

AC代码

#include<iostream>
#include<algorithm>
using namespace std;
int s[105][105],maxn[105][105];
int main()
{
    int n;
    while(cin>>n){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=i;j++)
            cin>>s[i][j];
    for(int i=1;i<=n;i++)
        maxn[n][i]=s[n][i];
    for(int i=n-1;i>=1;i--)
    for(int j=1;j<=i;j++){
        maxn[i][j]=max(maxn[i+1][j],maxn[i+1][j+1])+s[i][j];
    }
    cout<<maxn[1][1]<<endl;
    }
    return 0;
}