Cut the Sequence (单调队列优化DP)

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

qq_38665638

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

阅读量825

点赞数 1

分类专栏：算法学习

本文链接：https://blog.csdn.net/qq_38665638/article/details/79832223

版权

给定一个整数序列，任务是将其切割成若干连续子序列，每个子序列的和不超过给定的整数M，并且要最小化所有子序列中最大整数之和。输入包含序列长度N和限制值M，以及序列本身。输出符合条件的最小最大整数和，若不存在则输出-1。

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

Given an integer sequence { a_n } 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