[IOI 1994 / USACO1.5] Number Triangles

题目描述

Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be 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.

In the sample above, the route from $7$ to $3$ to $8$ to $7$ to $5$ produces the highest sum: $30$.

输入格式

The first line contains $R$ ($1 \le R \le 1000$), the number of rows. Each subsequent line contains the integers for that particular row of the triangle. All the supplied integers are non-negative and no larger than $100$.

输出格式

A single line containing the largest sum using the traversal specified.

输入样例 #1

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

输出样例 #1

30

说明/提示

IOI 1994 Day 1 T1 / USACO Training Section 1.5.

输入样例 #2

8
20
94 41
33 52 74
34 78 87 23
40 5 67 77 72
15 59 49 74 97 7
82 35 11 99 35 72 71
38 37 38 5 32 34 89 43

输出样例 #2

588

输入样例 #3

11
51
11 32
85 27 26
13 77 13 83
99 79 11 52 35
70 44 51 65 69 76
40 23 88 41 3 58 99
12 75 33 7 22 44 89 21
13 54 16 6 1 47 65 43 96
62 25 3 10 11 91 46 63 17 23
15 64 24 5 69 11 9 12 98 45 58

输出样例 #3

717

数据范围

The first line contains $R$ ($1 \le R \le 1000$), the number of rows. Each subsequent line contains the integers for that particular row of the triangle. All the supplied integers are non-negative and no larger than $100$.