POJ 3320 Jessica's Reading Problem （尺取法）

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

题意：

一本书有p页 每一页都有一个知识点ai 存在不同两页上的知识点相同的情况

求最少读连续的多少页书 能把所有的知识点全部覆盖到

尺取法：

反复的推进区间的开头和结尾 来求满足条件的最小区间的方法被称为尺取法

尺取法的复杂度为O(n).

 题解：

初始化 start  end  sum =0;

然后推进end 直到恰好满足条件退出 如果区间已经到了结尾 仍不满足 则退出

然后更新答案 ans = min(ans,end-start);

然后start推进一位，要处理这时对sum的影响

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
const int N=1e6+10;
const int mod=1e9+7;
int a[N];
int main()
{
    int n;
    while(~scanf("%d",&n)){
        map<int,int>mp;
        int num=0;
        for(int i=0;i<n;i++){
            scanf("%d",a+i);
            if(!mp[a[i]]) num++;
            mp[a[i]]++;
        }
        int st=0,t=0,sum=0,ans=n;
        mp.clear();
        while(1){
            while(t<n&&sum<num){
                if(!mp[a[t++]]++)
                    sum++;
            }
            if(sum<num) break;
            ans = min(ans,t-st);
            if(--mp[a[st++]]==0)
                sum--;
        }
        printf("%d
",ans);
    }
    return 0;
}