数字三角形 - Problem

#22715. 数字三角形

Statistics

考虑下面的数字三角形。编写程序，计算从顶部出发、在底边某处结束的路径所经过的数字之和的最大值。每一步可以斜向左下或斜向右下。

        7
      3   8
    8   1   0
  2   7   4   4
4   5   2   6   5

上例中，经过 7、3、8、7、5 的路径得到最大和 30。

输入格式

第一行包含行数 $R$（$1 \le R \le 1000$）。随后每行包含三角形对应行的整数。所有给出的整数非负且不超过 100。

输出格式

一行，包含按上述方式遍历能得到的最大和。

样例

输入格式 1

输出格式 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0