有一根20英寸的钢条,下面是一个尺寸从1到20个一个价格表:
prices={1, 5, 8, 9, 10, 17, 17, 20, 24, 30, 33, 35, 38, 40, 43, 45, 47, 50, 52, 55}
编写一个函数,用来求解如何切割钢条使其销售价格达到最大。
#include<iostream>
using namespace std;
int p[20] = { 1,5,8,9,10,17,17,20,24,30,33,35,38,40,43,45,47,50,52,55 };
int max(int a, int b)
{
return (a > b) ? a : b;
}
int SteelCuting(int p[], int n)
{
int *r = new int[n + 1];
r[0] = 0;
for (int j = 1; j <= n; j++)
{
int q = -1;
for (int i = 0; i <= j; i++)
{
if (i < 20)
q = max(q, p[i] + r[j - i - 1]);
else
q = max(q, r[10] + r[j - 20 - 1]);
}
r[j] = q;
}
return r[n];
}
int main()
{
int n;
cout << "请输入钢条的长度:";
cin >> n;
int sum = SteelCuting(p, n);
cout << "最大收益为:" << sum << endl;
return 0;
}