【Codeforces】-701C-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 numbern - 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

3AaA

output

2

input

7bcAAcbc

output

3

input

6aaBCCe

output

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.

题意：求一个最短的连续区间，可以包括所有出现的字符

题解：用尺取法，先取左端点L = 0，然后依次往后取，取到满足题意的结果后，再把左端点往右移，遇到不符合条件的，继续移动右端点，以此类推。在左端点右移的过程中，不断地更新结果ans的最小值即可。

#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;#define CLR(a,b)  memset(a,b,sizeof(a))#define M 100000#define inf 0x3f3f3f3fchar a[M+10];int vis[58];int main(){int n;while(~scanf("%d",&n)){int ant=0,num=0;//num记录不同的元素出现的总个数 CLR(vis,0);scanf("%s",a);for(int i=0;i<n;i++)if(!vis[a[i]-'A']){num++;//没有出现过，num++ vis[a[i]-'A']=1;}CLR(vis,0);//清零 int ans=inf;int st=0;//记录起点，开始在 0 for(int i=0;i<n;i++){if(!vis[a[i]-'A'])//ant记录新一轮不同字母出现数目，没有出现过，ant++ ant++;vis[a[i]-'A']++;//每个字母出现次数+1 if(ant==num) {while(ant==num){ans=min(ans,i-st+1);if(vis[a[st]-'A']==1)// st 起点到 i 终点只出现一次，再向后移动ant!=num,退出循环 ant--;vis[a[st]-'A']--;//起点出现次数先-1，再右移！！！不能反啊，反了就不对了 st++;}}}printf("%d\n",ans);} return 0;}