POJ 3320 Jessica's Reading Problem 【尺取法】
来源:互联网 发布:淘宝内衣代理货源 编辑:程序博客网 时间:2024/06/03 18:19
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
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))const int M=1e6+10;const int inf=0x3f3f3f3f;const int modd=1e9+7;int a[M],mod[M];int i,j,k,n,m;int S;set<int>all;map<int,int>cot;int main(){ while(~scanf("%d",&n)){ for(int i=0;i<n;i++){ scanf("%d",&a[i]); all.insert(a[i]); } m=all.size(); int ans=inf; int s=0,t=0,sum=0; while(1){ while(t<n&&sum<m){ if(cot[a[t++]]++==0)sum++; } if(sum<m)break; ans=min(ans,t-s); if(--cot[a[s++]]==0)sum--; } printf("%d\n",ans); } return 0;}
- POJ 3320 Jessica's Reading Problem 尺取法
- POJ 3320 Jessica's Reading Problem (尺取法)
- poj 3320 Jessica’s Reading Problem 【尺取法】
- poj 3320 Jessica's Reading Problem 【尺取法+STLmap set】
- poj 3320 Jessica's Reading Problem(尺取法+map/hash)
- POJ 3320 Jessica's Reading Problem(尺取法)
- POJ - 3320 Jessica's Reading Problem(尺取法)
- poj 3320 Jessica's Reading(尺取法 + Hash) Problem
- POJ - 3320 Jessica's Reading Problem(尺取法)
- poj 3320 Jessica's Reading Problem 【尺取法】
- poj 3320 Jessica's Reading Problem(尺取法)
- POJ-3320Jessica's Reading Problem(尺取法)
- POJ 3320 Jessica's Reading Problem(尺取法)
- Poj 3320 Jessica's Reading Problem【动态尺取法】
- POJ 3320 Jessica's Reading Problem(尺取法)
- poj--3320 Jessica's Reading Problem(尺取法)
- POJ 3320 Jessica's Reading Problem(尺取法)
- POJ 3320 Jessica's Reading Problem(尺取法)
- 学习日记-题型收集(1)
- C#委托与跨线程
- 贝叶斯定理解析
- MAC下Hadoop环境配置(模拟分布式模式)
- JAVA 计算字符串UTF8字符值
- POJ 3320 Jessica's Reading Problem 【尺取法】
- linux下 让执行的命令行进程在后台运行
- let和const命令
- css波浪线
- 文章标题
- java基础学习之可比性的实现
- vs2013+win10+opencv
- Spark 机器学习实践 :Iris数据集的分类
- 北大资源高层私分国有资产