//问题描述见算法分析与设计 吕国英
#include<iostream.h>
#include<math.h>
int main()
{
int a[7][8]={
{0,0,0,0,0,0,0,0},
{0,16,4,3,12,6,0,3},
{0,4,-5,6,7,0,0,2},
{0,6,0,-1,-2,3,6,8},
{0,5,3,4,0,0,-2,7},
{0,-1,7,4,0,7,-5,6},
{0,0,-1,3,4,12,4,2}
};
int path[7]={0,0,0,0,0,0,0};
int a1[7][8];
int i,j;
int m,n;
//复制一个出来
for(i=0;i<=6;i++)
{
for(j=0;j<=7;j++)
{
a1[i][j]=a[i][j];
}
}
//从第一行开始搜索,找做好的
for(i=2;i<=6;i++)//行从第二行开始
{
for(j=1;j<=7;j++)
{
//搜索它前边的五个位置的最大值
int temp=a1[i-1][j];//初始化的时候为正上方的位置
if(j<=3)
{
m=1;
}
else
m=j-2;
if(j>=5)
n=7;
else
n=j+2;
for(m;m<=n;m++)//找到他前边对应的最大值
{
if(temp<a1[i-1][m])
temp=a1[i-1][m];
}
a1[i][j]+=temp;//修改当前的值
}
}
//先找出最大值,再寻找路径
int Max=a1[6][1];
for(j=1;j<=7;j++)
{
if(Max<a1[6][j])
{
Max=a1[6][j];
path[6]=j;//记录位置
}
}
//倒着进行,主要是搜索值并存储在path中
for(i=5;i>=1;i--)
{
// cout<<path[i+1];
if(path[i+1]<=3)
m=1;
else
m=path[i+1]-2;
if(path[i+1]>=5)
n=7;
else
n=path[i+1]+2;
int temp=a1[i][path[i+1]];
for(m;m<=n;m++)
{
if(temp<=a1[i][m])
{
temp=a1[i][m];
path[i]=m;
}
}
}
//原图
cout<<"路径图为:/n";
for(i=1;i<=6;i++)
{
cout<<"/t";
for(j=1;j<=7;j++)
{
if((a[i][j]<0 && a[i][j]>-10)||(a[i][j]>10))//2个数字
cout<<a[i][j]<<" ";
if((a[i][j]<10&&a[i][j]>=0))//1个数字
cout<<a[i][j]<<" ";
}
cout<<endl;
}
cout<<"路径过程:/n/t";
for(i=1;i<7;i++)
cout<<a[i][path[i]]<<"----->";
cout<<"到达出口"<<endl;
cout<<"最大值为:---->"<<Max;
cout<<endl;
return 0;
}