动态规划之最大K乘积问题 代码

#include "iostream.h"
#include "stdio.h"
int putnum;
int f[99][99];
int ka[99][99];
int n,m;
conv(int i,int w)
{
 int j=i+w;
 int q=10;
 int p=10;
 for (int m=2;m<=n-j;m++)
 {
  q=q*10;
 }
 if (j==n)
 {
  q=1;
 }
 for (m=2;m<=j-i;m++)
 {
  p=p*10;
 }
 int pass= putnum/q%p;
 return pass;
}
void solve(int n,int m)
{
 int i,j,k;
 int temp,maxt,tk=0;
 for(i=1;i<=n;i++)
   f[i][1]=conv(0,i);
 for(j=2;j<=m;j++)
   for(i=j;i<=n;i++)
      {
       for(k=1,temp=0;k<i;k++)
         {
          maxt=f[k][j-1]*conv(k,i-k);
          if(temp<maxt)
            {
             temp=maxt;tk=k;
            }
          }
       f[i][j]=temp;ka[i][j]=tk;
      }
}  
void main()
{
 cout<<"please put your num mast < 10 bit) \n";
 cin>>putnum;
 cout<<"please put your num length \n";
 cin>>n;
 cout<<"how much do your want to carve up? \n";
 cin>>m;
 solve(n,m);
 cout<<(f[n][m])<<"\n";
}