数塔问题-DP解法
#include<iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int DataTower(int n,int d[][5]);
int main()
{
int d[5][5]={{8},{12,15},{3,9,6},{8,10,5,12},{16,4,18,10,9}};
DataTower(5,d);
}
int DataTower(int n,int d[][5]){
int path[n][n];
int maxAdd[n][n];
for(int i=0;i<=n-1;i++)
maxAdd[n-1][i]=d[n-1][i];
for(int i=n-2;i>=0;i--)
for(int j=0;j<=i;j++){
if(maxAdd[i+1][j]<maxAdd[i+1][j+1]){
maxAdd[i][j]=d[i][j]+maxAdd[i+1][j+1];
path[i][j]=j+1;
}else{
maxAdd[i][j]=d[i][j]+maxAdd[i+1][j];
path[i][j]=j;
}
}
cout<<"最大数值为:"<<maxAdd[0][0]<<endl;
cout<<"对应路径为:";
int row =0,col=0;
while(row<=n-1){
cout<<d[row][col]<<" ";
col=path[row][col];
row++;
}
}