Coursera OA Metals 求大神解题-格式贴

Mr. Octopus has recently shut down hisfactory and want to sell off his metal rods to a local businessman.

In order to maximize profit, he should sellthe metal of same size and shape. If he sells  metal rods of length ,he receives N x L xmetal_price. The remaining smallermetal rods will be thrown away. To cut the metal rods, he needs to pay cost_per_cut for every cut.

What is the maximum amount of money Mr.Octopus can make?

Input Format
First line of input contains c

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

01

100

10

3

26

103

59

Sample Output#01

1230

补充内容 (2016-10-4 07:42):
BruteForce 做，把maxRange内所有cutLength都遍历一遍，求高级解法！

超时了么

话说这题brute force做好像也不会超时吧，他限定范围那么小。。。

我也只想到brutal force，但感觉每次要遍历的cut-length很多啊。。

brute force 超时了，而且lz挂了。。。。