project euler 18
/ 动态规划解二叉树路径最大和问题,将所有的数放入二维数组中,从倒数第二行开始向上回溯,每个数只能与下面和右下的数相加,得最大值代之,依次上推。以下为c++代码实现,problem可类推之/
#include
using namespace std;
int main()
{
int triang[16][16] = {0};
for (int i = 1; i < 16; i++)
{
for (int j = 1; j <=i; j++)
{
cin >> triang[i][j];
}
}
for (int i = 14; i > 0; i–)
{
for (int j = i; j > 0; j–)
{
if (triang[i + 1][j] > triang[i + 1][j + 1])
triang[i][j] += triang[i + 1][j];
else
triang[i][j] += triang[i + 1][j + 1];
}
}
cout << triang[1][1];
return 0;
}