#include<stdio.h>
int a[100][100];//下三角形存放数据
int max1(int i,int j,int n)//递归函数
{
	int left,right;
	if((i==n-1)||(j==n-1))//到达边缘
		return a[i][j];
	left=max1(i+1,j,n);//左边
	right=max1(i+1,j+1,n);//右边
	return (left>right)? (left+a[i][j]):(right+a[i][j]);
}
main()
{
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<=i;j++)
			scanf("%d",&a[i][j]);
	printf("%d",max1(0,0,n));
}

• 从下往上简单的递推就行了 (109) hz02ruc 2004-02-22 18:16:27