[转]http://old.blog.edu.cn/user3/dongshan/archives/2006/1466731.shtml
The Triangle Time Limit:1000MS Memory Limit:10000KTotal Submit:3394 Accepted:1971
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.
InputYour 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.
OutputYour program is to write to standard output. The highest sum is written as an integer.
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
数字三角形问题,最基本的DP问题,由于题目只要求求出最大和值,这里不需要额
外的空间开销来存储中间值,在从第n-1行往第一行算时可以直接根据前面的值来
确定由这一行的每个值到最后一行最大和值,然后根据此和值覆盖掉址行的数据即可。
在算由第i行的第j个元素到第n行的最大值时,根据第i+1行的第j与j+1个元素值,
a(i,j)=a(i,j)+max(a(i+1,j),a(i+1,j+1))即可。
求解过程:
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
第一步:
7
3 8
8 1 0
7 12 10 10 从这一行开始,根据下一行值确定此行最大和
第二步:
7
3 8
20 13 10
7 12 10 10
4 5 2 6 5
第三步:
7
23 21
20 13 10
7 12 10 10
4 5 2 6 5
第四步:
30 <---------- (最大和值7+23)
23 21
20 13 10
7 12 10 10
4 5 2 6 5
C程序:
#i nclude<stdio.h>
main()
{
int n,a[101][101],i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)scanf("%d",&a[i][j]);
for(j=n-1;j>=1;j--)
for(i=1;i<=j;i++)
if(a[j+1][i]>a[j+1][i+1])a[j][i]+=a[j+1][i];
else a[j][i]+=a[j+1][i+1];
printf("%d",a[1][1]);
}