數字三角形 - 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