题解：Pangu and Stones （区间dp）

最新推荐文章于 2020-08-23 11:08:57 发布

嘘......

最新推荐文章于 2020-08-23 11:08:57 发布

阅读量186

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/99714618

版权

这是一篇关于中国神话中盘古的故事，盘古想要将地面上的石头堆合并成一座大山。给定N堆石头，每堆数量为ai，盘古每次只能合并连续的L到R堆，并且需要在S秒内完成。问题要求找出最小的完成时间，如果无法完成任务则输出0。题目需要使用区间动态规划策略来解决。

摘要由CSDN通过智能技术生成

In Chinese mythology, Pangu is the first living being and the creator of the sky and the earth. He woke up from an egg and split the egg into two parts: the sky and the earth.
At the beginning, there was no mountain on the earth, only stones all over the land.
There were N piles of stones, numbered from 1 to N. Pangu wanted to merge all of them into one pile to build a great mountain. If the sum of stones of some piles was S, Pangu would need S seconds to pile them into one pile, and there would be S stones in the new pile.
Unfortunately, every time Pangu could only merge successive piles into one pile. And the number of piles he merged shouldn’t be less than L or greater than R.
Pangu wanted to finish this as soon as possible.
Can you help him? If there was no solution, you should answer ‘0’.

Input

There are multiple test cases.
The first line of each case contains three integers N,L,R as above mentioned (2<=N<=100,2