POJ3017 Cut the Sequence（单调队列优化dp）好题！！必做！！

最新推荐文章于 2022-02-08 00:33:57 发布

原创

最新推荐文章于 2022-02-08 00:33:57 发布 · 765 阅读

3 ·

CC 4.0 BY-SA版权

该博客介绍了如何使用单调队列优化动态规划来解决POJ3017问题。问题要求将一个整数序列切割成连续子序列，每个子序列和不超过给定值M，目标是最小化所有子序列最大值之和。博客给出了题意解释、解题思路以及代码实现。

Cut the Sequence POJ - 3017

Given an integer sequence { an } of length N, you are to cut the sequence into several parts every one of which is a consecutive subsequence of the original sequence. Every part must satisfy that the sum of the integers in the part is not greater than a given integer M. You are to find a cutting that minimizes the sum of the maximum integer of each part.
Input
The first line of input contains two integer N (0 < N ≤ 100 000), M. The following line contains N integers describes the integer sequence. Every integer in the sequence is between 0 and 1 000 000 inclusively.

Output
Output one integer which is the minimum sum of the maximum integer of each part. If no such cuttings exist, output −1.
Sample Input
8 17
2 2 2 8 1 8 2 1
Sample Output
12
Hint
Use 64-bit integer type to hold M.