1163：The Triangle

题目描述

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.

输入样例

输出样例

该题目是Virtual Judge题目，来自北京大学POJ

题目来源 IOI 1994

源链接： POJ-1163

最后修改于 2020-10-29 05:54:27 UTC 由爬虫自动更新

共提交 2 次

通过率 0.0%

时间上限	内存上限
1000	10000

登陆或注册以提交代码