[Codeforces 985.E] Pencils and Boxes（dp，前缀和优化）

最新推荐文章于 2021-07-31 09:58:53 发布

PhantomAgony

最新推荐文章于 2021-07-31 09:58:53 发布

阅读量387

点赞数

分类专栏： ~算法集合动态规划-序列dp

本文链接：https://blog.csdn.net/PhantomAgony/article/details/80471244

版权

题目要求将铅笔分配到盒子里，每个盒子至少有k支铅笔，并且同一盒内的铅笔颜色饱和度差不超过d。解题思路是通过排序和动态规划来判断是否可能满足条件。dp[i]表示前i个铅笔是否能放入盒子，通过前缀和优化，可以在O(N)的时间复杂度内完成查询。

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

E. Pencils and Boxes

time limit per test: 2 seconds
memory limit per test: 256 megabytes
input: standard input
output: standard output

Mishka received a gift of multicolored pencils for his birthday! Unfortunately he lives in a monochrome world, where everything is of the same color and only saturation differs. This pack can be represented as a sequence $a_1, a_2, ..., a_n$ of n integer numbers — saturation of the color of each pencil. Now Mishka wants to put all the mess in the pack in order. He has an infinite number of empty boxes to do this. He would like to fill some boxes in such a way that:

Each pencil belongs to exactly one box;
Each non-empty box has at least $k$ pencils in it;
If pencils $i$ and $j$ belong to the same box, then $|a_i - a_j| ≤ d$ , where $|x|$ means absolute value of $x$ . Note that the opposite is optional, there can be pencils $i$ and $j$ such that $| a_{i} - a_{j} | \leq d$