目录
一、问题描述
二、代码
#include <iostream>
#include <stdio.h>
using namespace std;
int BestWay(int n,int a[][100]){
int i, j;
for(i = n - 2; i >= 0; i--){
for(j = 0; j <=i; j++){
a[i][j] = a[i][j] + max(a[i+1][j],a[i+1][j+1]);
}
}
return a[0][0];
}
int main()
{
int n, i, j;
scanf("%d",&n);
int a[100][100] = {-1};
for(i = 0; i < n; i++){
for(j = 0; j <= i; j++)
scanf("%d",&a[i][j]);
}
printf("%d",BestWay(n,a));
return 0;
}