題目描述

            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.
• The number of rows in the triangle is >1 but <=100.
• The numbers in the triangle, all integers, are between 0 and 99.

輸入格式

Data about the number of rows in the triangle are first

輸出格式

The highest sum is written as an integer.

Samples

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

30

原始資料

• Zero1 題號：a991
• Hydro 題號：Z0991
• Locale：zh_TW
• Display：open