## [ACM_POJ_1163]动态规划入门练习（一）The Triangle

### The Triangle

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 28092 Accepted: 16504

#### Description

```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.

#### Input

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.

#### Output

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
```

#### Source

POJ1163

```#include<stdio.h>
int main(){
int n, i, j;
scanf("%d", &n);
int **a = new int*[n];
for(i = 0; i < n; ++i){
a[i] = new int[i + 1];
for(j = 0; j <= i; ++j){
scanf("%d", &a[i][j]);
}
}
for(i = n - 2; i >=0; --i){
for(j = 0; j <= i; ++j){
a[i][j] += a[i + 1][j] > a[i + 1][j + 1] ? a[i + 1][j] : a[i + 1][j + 1];
}
}
printf("%d", a[0][0]);
return 0;
}
```

#### 2 条评论 »

1. 我是一只小小鱼

不到20行的代码，0s，不超200k内存！佩服！LZ，好想知道你是怎么写出这题代码？

1. 几年前写的了，如今好久没碰算法了T_T。。