技巧----尺取法链接
Jessica’s Reading Problem
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 20986 Accepted: 7177
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
Source
POJ Monthly–2007.08.05, Jerry
题意分析:
与第一题类似
1.Poj3061 - Subsequence (尺取法枚举区间)
同样套尺取模板,同时给用到stl中map/set方便处理数据进行操作
比较水 就当作练习了一遍map/set定义
#include<iostream>
#include<map>
#include<set>
#define maxn 1000010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
int a[maxn];
map<int,int> cnt;
set<int> t;
int p,ans=inf,st,en,sum;
int main()
{
cin>>p;
for(int i=0;i<p;i++)
{
cin>>a[i];
t.insert(a[i]);
}
int num=t.size();//计算一共含有多少个知识点
//cout<<num;
while(1)
{
while(en<p&&sum<num)
if(cnt[a[en++]]++ ==0) sum++; //尺取后端后移
if(sum<num) break;
ans=min(ans,en-st);
if(--cnt[a[st++]]==0) sum--; //尺取前端后移
}
cout<<ans<<endl;
return 0;
}