HDU 斜率优化dp 3507 Print Article

最新推荐文章于 2020-05-21 21:25:44 发布

Killerfear

最新推荐文章于 2020-05-21 21:25:44 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏：动态规划

本文链接：https://blog.youkuaiyun.com/wsx1754175/article/details/22824461

这篇博客介绍了如何利用斜率优化动态规划方法解决一个关于单词分配行的问题，目标是最小化费用。博主提供了一个动态转移方程，并通过斜率优化来避免超时，解释了优化过程并给出了代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Print Article

Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 4567 Accepted Submission(s): 1370

Problem Description

Zero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certainly wear and tear, so Zero use a cost to evaluate this degree.
One day Zero want to print an article which has N words, and each word i has a cost Ci to be printed. Also, Zero know that print k words in one line will cost