Cpp环境【POJ3320】Jessica's Reading Problem 洁西卡的复习计划

最新推荐文章于 2019-01-16 20:46:00 发布

cqyz_Lebmond

最新推荐文章于 2019-01-16 20:46:00 发布

阅读量465

点赞数 2

分类专栏：基础算法之一查找搜索&排序算法科技之滑动窗口难度评级 Time Required 文章标签： cpp poj 滑动窗口

本文链接：https://blog.csdn.net/arkhamorginal/article/details/52022325

版权

洁西卡面临期末考试，需要读完一本涵盖所有知识点的厚书。给定每页的知识点，目标是找出最少的连续页数来覆盖所有知识点。这是一个滑动窗口的应用问题，通过维护一个映射来统计知识点出现次数，并在窗口内包含所有知识点时尝试缩小窗口。最终找到的最小区间长度即为答案。

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

Description  【问题描述】

Jessica’s a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master all ideas included in a very thick text book. The author of that text book, like other authors, is extremely fussy about the ideas, thus some ideas are covered more than once. Jessica think if she managed to read each idea at least once, she can pass the exam. She decides to read only one contiguous part of the book which contains all ideas covered by the entire book. And of course, the sub-book should be as thin as possible.
A very hard-working boy had manually indexed for her each page of Jessica’s text-book with what idea each page is about and thus made a big progress for his courtship. Here you come in to save your skin: given the index, help Jessica decide which contiguous part she should read. For convenience, each idea has been coded with an ID, which is a non-negative integer.

　　（省略无数无关词）为准备考试，Jessica开始阅读一本很厚的课本。要想通过考试，她必须把课本中所有知识点都掌握。这本书总共有P页，第i页恰好有一个知识点a[i]（每个知识点都有一个整数编号）。全书中同一个知识点可能会被多次提到，所以她希望通过阅读其中连续的一些页把所有的知识点都覆盖到。给定每页写到的知识点，请求出要阅读的最少页数。