codeforce701 C. They Are Everywhere

C. They Are Everywhere
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Sergei B., the young coach of Pokemons, has found the big house which consists of n flats ordered in a row from left to right. It is possible to enter each flat from the street. It is possible to go out from each flat. Also, each flat is connected with the flat to the left and the flat to the right. Flat number 1 is only connected with the flat number 2 and the flat number n is only connected with the flat number n - 1.

There is exactly one Pokemon of some type in each of these flats. Sergei B. asked residents of the house to let him enter their flats in order to catch Pokemons. After consulting the residents of the house decided to let Sergei B. enter one flat from the street, visit several flats and then go out from some flat. But they won’t let him visit the same flat more than once.

Sergei B. was very pleased, and now he wants to visit as few flats as possible in order to collect Pokemons of all types that appear in this house. Your task is to help him and determine this minimum number of flats he has to visit.
Input

The first line contains the integer n (1 ≤ n ≤ 100 000) — the number of flats in the house.

The second line contains the row s with the length n, it consists of uppercase and lowercase letters of English alphabet, the i-th letter equals the type of Pokemon, which is in the flat number i.
Output

Print the minimum number of flats which Sergei B. should visit in order to catch Pokemons of all types which there are in the house.
Examples
Input
Copy

3
AaA

Output
Copy

2

Input
Copy

7
bcAAcbc

Output
Copy

3

Input
Copy

6
aaBCCe

Output
Copy

5

Note

In the first test Sergei B. can begin, for example, from the flat number 1 and end in the flat number 2.

In the second test Sergei B. can begin, for example, from the flat number 4 and end in the flat number 6.

In the third test Sergei B. must begin from the flat number 2 and end in the flat number 6.
尺取法 注意技巧

#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
using namespace std;
map<char,int> M;			//标记
set<char> S;
	int n;
	string s;
void Init()
{
	for(int i=0;i<n;i++)
		M[s[i]]=1;
}
int main()
{

	cin>>n;
	
	int typen=0;
	cin>>s;
	
	for(int i=0;i<n;i++)
	{
		//	M[s[i]]++;
			
			S.insert(s[i]);
		
	}
	typen=S.size();
	//cout<<typen<<endl;
	/*
	for(int i=0;i<n;i++)
		cout<<M[s[i]]<<" ";
	cout<<endl;
	*/
	
	int l=0,r=0;
	int ans_type=0;
	int res=n;
	/*右指针大刀阔斧的走 左指针一步一步地走*/           //左指针走稳点！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！1
	while(1)
	{
		while(r<n &&ans_type<typen)		//满足两个条件进行
		{
			if(M[s[r++]]++ ==0)				//右指针向右走  
				ans_type++;					
		}
		/*while循环退出有两个个原因*/
		if(ans_type<typen)			//右指针走到头仍不满足ans_type>=type  直接break				1.r>=n
			break;
		res=min(res,r-l);			//更新答案													2.ans_type>=type   这个才是正常退出循环的条件

		if(--M[s[l++]]==0)				//左指针向右走 类型数量仍然>=type   则优化序列          
		{
			ans_type--;					//类型计数
		}

	}
	cout<<res<<endl;
	return 0;
}