动态规划切钢条问题

#include<iostream>

using namespace std;

#define NIL (-0x7fffffff-1)

{ 

if(a>=b)

return a;

else return b;

}

int cut_rod(int *p,int n)

{

if(n==0) return 0;

int q=NIL;

if(n<=10)

{

for (int i=0;i<n;i++)

{

q=max(q,p[i]+cut_rod(p,n-1-i));

}

return q;

}

else if(n>10)

{ int b=n/10; n=n-b*10; if(n==0) q=0; for (int i=0;i<n;i++)

{ q=max(q,p[i]+cut_rod(p,n-1-i));; }

return q+b*30; }

}

int main()

{ int p[]={1,5,8,9,10,17,17,20,24,26};

int n; cout<<"Please input a int number: ";

cin>>n;

int result=cut_rod(p,n);

cout<<result<<endl;

return 0;

}

int max(int a,int b)