Jessica's Reading Problem
2016-05-25 21:06
281 查看
第一部分:题目
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
Sample Output
第二部分:代码
View Code
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
5 1 8 8 8 1
Sample Output
2
第二部分:代码
/* 学会使用set、map来简化操作。 */ #include<iostream> #include<stdio.h> #include<set> #include<map> using namespace std; int main() { int page[1000010],n; cin>>n; //利用set中不存在相同元素的特点计算有多少个不同的知识点 set<int> all; for(int i=0;i<n;i++) { scanf("%d",&page[i]); //cin>>page[i];//这里使用cin真的慢,贼慢 all.insert(page[i]); } int point=all.size();//有多少个不同的知识点 //尺取法:通俗点,就是一段一段看 int s=0,t=0,num=0; int min=n; map<int,int> fuck;//知识点->出现次数 while(1) { while(t<n&&num<point) { //出现新的知识点 if(fuck[page[t++]]++==0) { num++; } } if(num<point) { break; } if(min>t-s) { min=t-s; } //去除了一个知识点 if(--fuck[page[s++]]==0) { num--; } } cout<<min<<endl; return 0; }
View Code
相关文章推荐
- git 简明指南---使用教程
- listview 点击错乱
- redis - Java操作
- 高精度对数函数的实现二
- Android在xml中设置点击事件不响应
- 第13周实践项目2动物这样叫(2)
- 第十三周项目1.4—分数类中的运算符重载
- 打飞机
- mybatis 动态sql详解
- Spring 整合 Redis
- 数据结构实验之栈:行编辑器
- Android--Bundle类
- 1341 - Aladdin and the Flying Carpet ---light oj (唯一分解定理+素数筛选)
- 聚类算法实践(一)——层次聚类、K-means聚类
- C语言程序设计感想
- 51 NOD 1189 阶乘分数(素因子分解+推公式+求逆元)
- opencv入门建议和资源推荐
- C++第六次作业
- bzoj1901 Zju2112 Dynamic Rankings
- 菜鸟学Java之错将for循环大写