当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1158:Employment Planning

题目描述
A project manager wants to determine the number of the workers needed in every month. He does know the minimal number of the workers needed in each month. When he hires or fires a worker, there will be some extra cost. Once a worker is hired, he will get the salary even if he is not working. The manager knows the costs of hiring a worker, firing a worker, and the salary of a worker. Then the manager will confront such a problem: how many workers he will hire or fire each month in order to keep the lowest total cost of the project.
输入解释
The input may contain several data sets. Each data set contains three lines. First line contains the months of the project planed to use which is no more than 12. The second line contains the cost of hiring a worker, the amount of the salary, the cost of firing a worker. The third line contains several numbers, which represent the minimal number of the workers needed each month. The input is terminated by line containing a single '0'.
输出解释
The output contains one line. The minimal total cost of the project.
输入样例
3 
4 5 6
10 9 11
0
输出样例
199
来自杭电HDUOJ的附加信息
Recommend Ignatius

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1158

最后修改于 2020-10-25T22:42:35+00:00 由爬虫自动更新

共提交 112

通过率 78.57%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)