数塔问题

#include <iostream>
#define N 50
using namespace std;
//a[.][.][0]存储原始数据
//a[.][.][1]存储存储动态规划过程
//a[.][.][2]存储最优化路径
int main()
{
int a

[3];
cout<<"please input the number of rows:";
int rnum;
cin>>rnum;
if (rnum<1)
{
cout<<"输入有误"<<endl;
exit(1);
}
//初始化
for (int i=0;i<rnum;++i)
{
cout<<"please input the "<<i+1<<" row."<<endl;
for (int j=0;j<=i;++j)
{
cin >> a[i][j][0];
a[i][j][1] = a[i][j][0];
a[i][j][2] = 0;
}
}

for (int i=rnum-2;i>=0;--i)
{
for (int j=0;j<=i;++j)
{
if (a[i+1][j][1] > a[i+1][j+1][1])
{
a[i][j][1] += a[i+1][j][1]; //加上左边的数
a[i][j][2] = 0;  //左边的数大，向左走
}
else
{
a[i][j][1] += a[i+1][j+1][1]; //加上右边的数
a[i][j][2] = 1;  //右边的数大，向右走
}
}
}
cout<< "a[i][j][0]存储原始数据如下:"<<endl;
for (int i=0;i<rnum;++i)
{
for (int j=0;j<=i;++j)
{
cout<< a[i][j][0]<<' ';
}
cout<<endl;
}
cout<< "a[i][j][1]存储动态规划过程如下:"<<endl;
for (int i=0;i<rnum;++i)
{
for (int j=0;j<=i;++j)
{
cout<< a[i][j][1]<<' ';
}
cout<<endl;
}
cout<< "a[i][j][2]存储最优解路径如下:"<<endl;
for (int i=0;i<rnum;++i)
{
for (int j=0;j<=i;++j)
{
cout<< a[i][j][2]<<' ';
}
cout<<endl;
}
cout<<"max = "<<a[0][0][1]<<endl;
int col = 0;
cout<<"路径："<<endl;
for (int i=0;i<rnum-1;++i)
{
cout<<a[i][col][0]<<"->";
col += a[i][col][2];
}
cout<<a[rnum-1][col][0]<<endl;
return 0;
}

// 9
// 12 15
// 10 6 8
// 2 18 9 5
// 19 7 10 4 16