[LintCode] Copy Books 复印书籍

最新推荐文章于 2020-02-08 17:02:17 发布

weixin_34194702

最新推荐文章于 2020-02-08 17:02:17 发布

阅读量135

点赞数

CC 4.0 BY-SA版权

原文链接：https://yq.aliyun.com/articles/339118

本文讨论了一个关于分配不同数量页数的书籍给不同的人进行复印的问题。目标是在保持书本顺序不变的情况下，找到一种分配方式使得所有人完成复印所需的时间最短。以数组A=[3,2,4]和k=2为例，第一人复印前两本书需5分钟，第二人复印第三本书需4分钟，总用时9分钟为最小值。挑战在于能否在O(n*k)时间内解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array A of integer with size of n( means n books and number of pages of each book) and k people to copy the book. You must distribute the continuous id books to one people to copy. (You can give book A[1],A[2] to one people, but you cannot give book A[1], A[3] to one people, because book A[1] and A[3] is not continuous.) Each person have can copy one page per minute. Return the number of smallest minutes need to copy all the books.

Have you met this question in a real interview?

Yes

Example

Given array A = [3,2,4], k = 2.

Return 5( First person spends 5 minutes to copy book 1 and book 2 and second person spends 4 minutes to copy book 3. )

Challenge

Could you do this in O(n*k) time ?

本文转自博客园Grandyang的博客，原文链接：复印书籍[LintCode] Copy Books ，如需转载请自行联系原博主。