POJ 3320 Jessica's Reading Problem(尺取法)
2016-04-28 00:08
459 查看
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
本书参考挑战程序设计一书,代码精巧简洁,贴上来参考。
AC代码:
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
本书参考挑战程序设计一书,代码精巧简洁,贴上来参考。
AC代码:
# include <cstdio> # include <set> # include <map> # include <algorithm> using namespace std; set<int> all; map<int, int> Count; int a[1000010]; int main(){ int p, i, j, k, num, n, s, t, ans; while(scanf("%d", &p)!=EOF){ for(i=1; i<=p; i++){ scanf("%d", &a[i]); } for(i=1; i<=p; i++){ all.insert(a[i]); } n=all.size(); num=0;s=1;t=1;ans=p; while(1){ while(t<=p&&num<n){ if(Count[a[t++]]++==0){ num++; } } if(num<n){ break; } ans=min(ans, t-s); if(--Count[a[s++]]==0){ num--; } } printf("%d\n", ans); } return 0; }
相关文章推荐
- Mysql(一)安装使用
- java操作ftp实现文件的上传下载(适用于图片文档服务器)
- Java ArrayList工作原理及实现
- 快速排序 一般分割
- Android 深入理解Android中的自定义属性
- 团队开发
- 写个js程序咖常写的游戏-贪吃蛇
- UEFI模式下安装Windows 10、Ubuntu 16.04 LTS双系统教程
- JSP学生信息管理系统
- Aspnetpager对GridView分页并顺利导出Excel
- ASP.NET项目开发中日期控件DatePicker如何使用
- ASP.NET使用My97DatePicker日期控件实例
- ASP.NET My97DatePicker日期控件实现OA日期记事功能
- 在ASP.NET 2.0中操作数据:创建一个业务逻辑层
- Python网络爬虫实例讲解
- python遍历目录的方法小结
- Python中MySQL数据迁移到MongoDB脚本的方法
- PHP在线调试执行的实现方法(附demo源码)
- Yii2搭建后台并实现rbac权限控制完整实例教程
- Yii2 rbac权限控制之菜单menu实例教程