代码:
#include <iostream>
#include<string.h>
using namespace std;
int num[100][100],dp[100][100];
int min(int a, int b)
{return a<b?a:b;}
int main()
{
int n,i,j;
cout<<"请输入数塔的层数:"<<endl;
cin>>n;
cout<<"请输入数值:"<<endl;
for(i = 1; i<= n; i++)
for(j = 1; j<=i; j++)
{
cin>>num[i][j];
dp[i][j] = num[i][j];
}
for(i = n-1; i>0; i--)
for(j = 1; j<= i; j++)
{
dp[i][j] = min(dp[i+1][j],dp[i+1][j+1])+num[i][j];
}
cout<<"最短路径值为:"<<endl;
cout<<dp[1][1]<<endl;
cout<<"路径:"<<endl;
cout<<num[1][1]<<" ";
int m = dp[1][1],d = num[1][1],ti=1,tj=1;
for(i = 2; i<=n; i++)
{ m -= d; ti = i;
if(m == dp[ti][tj])
{
cout<<num[ti][tj]<<" ";
d = num[ti][tj];
}
else if(m == dp[ti][tj+1])
{
tj += 1;
cout<<num[ti][tj]<<" ";
d = num[ti][tj];
}
}
return 0;
}
图片: