树塔问题.txt

算法设计中数塔问题的源代码！希望对大家有用！

#include"iostream.h"
//#include<string>
//using namespace std;


int shuta[51][51][3];
int i,j,k,n,kk=1;
 
void  main()
{ 
cout<<"班级:信计042  姓名:程帅帅 学号:20043970：\n"<<endl;
while(kk)
 {  cout<<"输入数塔层数n:";
    cout<<"  ";cin>>n;
    cout<<endl;
 cout<<"提示:(请照要求输入数塔各层的数据,"<<endl;
    cout<<"数据用空格隔开，结束时按enter键.)";cout<<endl;
 cout<<endl;
             {   for(i=1;i<=n;i++)
      {  cout<<"输入数塔"<<i<<"层的"<<i<<"个数:";
             for (k=1;k<=n-i;k++)
       cout<<" ";
                      for(j=1;j<=i;j++)
                      {    
                            cin>>shuta[i][j][0];
                            shuta[i][j][1]=shuta[i][j][0];
                            shuta[i][j][2]=0;
                      }
      }
         for(i=n-1;i>=1;i--)
                      for(j=1;j<=i;j++)
                     {
                             if(shuta[i+1][j][1]>shuta[i+1][j+1][1])
                             {
                                    shuta[i][j][1]+=shuta[i+1][j][1];
                                    shuta[i][j][2]=0;
                             }
                             else
                             {
                                    shuta[i][j][1]+=shuta[i+1][j+1][1];
                                    shuta[i][j][2]=1;
                             }
                      } 
       cout<<"此数塔为:"<<endl;
   //PrintShuTa(shuta,n);
        {   for(i=1;i<=n;i++)
      {  //cout<<"输入数塔"<<i<<"层的"<<i<<"个数:";
             for (k=1;k<=n-i+5;k++)
       cout<<" ";
                      for(j=1;j<=i;j++)
                      {    cout<<" ";
                            cout<<shuta[i][j][0];
                            //shuta[i][j][1]=shuta[i][j][0];
                            //shuta[i][j][2]=0;
                      }
       cout<<endl;
        }}
         cout<<endl;
         cout<<"此数塔路径的最大值:";
         cout<<"Max="<<shuta[1][1][1]<<endl<<"此数塔的最大路径为:";
               j=1;
               for(i=1;i<=n-1;i++)
               {
                      cout<<shuta[i][j][0]<<"->";
                      j+=shuta[i][j][2];
               }
               cout<<shuta[i][j][0]<<endl<<endl<<endl;     
      //cout<<"请输入数塔层数继续运行:";
 }


    cout<<"输入数字0结束，输入1继续运行.";
    cin>>kk;}
 }