尺取法技巧练习题及解答

题目链接在代码头部（自取）

//https://vjudge.net/problem/POJ-3320
#include<iostream>
#include<map>
#include<set>
using namespace std;
const int maxn = 1e7;
set<int>s;
map<int,int>m;
int a[maxn];
int n,sum,len,l,r,ans;
int main()
{
   
    ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); 
	cin>>n;
	ans = n+1;
	for(int i = 0;i<n;i++) cin>>a[i] , s.insert(a[i]);
	sum = s.size();
	l = r = len = 0;
	while(1)
	{
   
		while(len<sum && r<n)
		{
   
			if(m[a[r++]]++ == 0) len++;
		}
		if(len<sum) break;
		ans = min(ans,r-l);
		if(--m[a[l++]] == 0) len--;
	}
	cout<<ans<<"\n";
	return 0;
}

//----------------------------------------------------------