Codeforces Round #278 (Div. 1) B. Strip(Dp+multiset维护)
题目链接 题意：给你n个数，然后把他们分成区间，要求区间尽量少，区间长度不小于L，区间的最大减去最小不小于S。 解法：官方题解： We can use dynamic programming to solve this problem. Let f[i] denote the minimal number of pieces that the first i numbers can b
