문제1115--The Triangle

### 1115: The Triangle

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 312  통과: 213
[제출] [채점기록] [묻고답하기]

#### 문제 설명

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 $\leq 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.

#### 입력 예시 Copy

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

#### 출력 예시 Copy

30