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.
- 樣例輸入
-
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
- 樣例輸出
-
30
#include <stdio.h> #include <stdlib.h> #define Max 101 int record[Max][Max]; int num[Max][Max]; int main (){ int i, j; int N; scanf("%d", &N); for(i = 0; i < N; i++) { for(j = 0; j < i + 1; j++) { scanf("%d", &num[i][j]); } } for(i = 0; i < N; i++) { record[N - 1][i] = num[N - 1][i]; } for(i = N - 2; i >= 0; i--) { for(j = 0; j <= i; j++) { if(record[i + 1][j] > record[i + 1][j + 1]){ record[i][j] = record[i + 1][j] + num[i][j]; } else{ record[i][j] = record[i + 1][j + 1] + num[i][j]; } } } printf("%d\n", record[0][0]); }