POJ3320尺取法
来源:互联网 发布:ubuntu安装配置samba 编辑:程序博客网 时间:2024/04/28 02:52
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.
Input
The first line of input is an integer P (1 ≤ P ≤ 1000000), which is the number of pages of Jessica's text-book. The second line contains P non-negative integers describing what idea each page is about. The first integer is what the first page is about, the second integer is what the second page is about, and so on. You may assume all integers that appear can fit well in the signed 32-bit integer type.
Output
Output one line: the number of pages of the shortest contiguous part of the book which contains all ideals covered in the book.
Sample Input
51 8 8 8 1
Sample Output
2
题目大意:
看最小的页数,获得整本书的所有知识点。求这个页数是多少。
遇到的问题和思路:
挑战程序竞赛149的例题。个人在这里先整理一下思路:①用利用set集合里面元素的唯一性,将a[i]的所有元素放到里面去,这样就知道了一共有几个知识点。②尺取法的原理是从起始left到末端right中寻找答案,然后利用map的映射,获得每个知识点所出现的数目即可。③退出条件是sun < 知识点数目。
给出代码:
- 尺取法--poj3320
- poj3320 尺取法
- 尺取法 poj3061 poj3320
- poj3320 尺取法~~
- POJ3320尺取法
- poj3320尺取法
- POJ3320尺取法
- 尺取法+POJ3320
- POJ3320 尺取法
- poj3320 尺取法
- POJ3320---Jessica's Reading Problem(尺取法)
- [尺取法] poj3320 Jessica's Reading Problem
- POJ3320 Jessica's Reading Problem 尺取法
- POJ3320-Jessica's Reading Problem【尺取法】
- POJ3320 Jessica's Reading Problem(尺取法)
- poj3320 Jessica's Reading Problem 尺取法
- POJ3320 Jessica's Reading Problem【尺取法】
- POJ3320 -- Jessica's Reading Problem(尺取法)
- IoRegisterFsRegistrationChange routine
- 51nod 1215:数组的宽度 单调栈
- Asymptotic notation
- Combination Sum III 题解
- KMP算法
- POJ3320尺取法
- ireport启动问题
- LeetCode 56. Merge Intervals
- bzoj3207
- 顺序表应用4:元素位置互换之逆置算法
- [从头学数学] 第80节 数学广角──植树问题
- Hibernate注解
- android的数据传递
- bzoj1407【NOI2002】Savage