nyoj18 The triangles 【DP】

本文主要是介绍nyoj18 The triangles 【DP】，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

描述

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>
int a[101][101];
int max( int a, int b)
{
return a>b?a:b;
}
int main()
{
int n, i, j;
while( ~scanf( "%d", &n ) )
{
for( i = 0; i < n; i ++ )
for( j = 0; j <= i; j ++ )
scanf( "%d", &a[i][j] );
for( i = n-2; i >= 0; i -- )
for( j = i; j >= 0; j -- )
a[i][j] +=max( a[i+1][j], a[i+1][j+1] );
printf( "%d\n", a[0][0] );
}
return 0;
} 

这篇关于nyoj18 The triangles 【DP】的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---