NYOJ The Triangle

最新推荐文章于 2022-03-07 08:58:59 发布

Lawliet_ZMZ

最新推荐文章于 2022-03-07 08:58:59 发布

阅读量420

点赞数

分类专栏：动态规划（DP） ACM算法竞赛之路

本文链接：https://blog.csdn.net/major_zhang/article/details/51471549

版权

ACM算法竞赛之路同时被 2 个专栏收录

148 篇文章 7 订阅

订阅专栏

动态规划（DP）

11 篇文章 0 订阅

订阅专栏

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.

样例输入

样例输出

#include <iostream>
using namespace std;
const int N = 105;

int a[N][N];

int main(){
  int i,j,n;
  cin>>n;
  for(i=0;i<n;i++){
    for(j=0;j<=i;j++)
       cin>>a[i][j];}
  for(i=n-2;i>=0;i--){
    for(j=0;j<=i;j++)
    a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
  }
  cout<<a[0][0]<<endl;
  return 0;
  }