codeforces 701C They Are Everywhere(尺取法)

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

3
AaA

output

2

input

7
bcAAcbc

output

3

input

6
aaBCCe

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.

题意：在字符串中找一个最短的包含其所有字母种类的子串，输出最小长度

题解：先找到原串中所有的字母种类，然后做尺取法。R往右移，直到包含所有种类。再L右移，同时减去L字符的个数。更新最小长度。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 100100
char str[maxn];
int big[30];//分别记录某种大写字母出现的个数 
int lit[30];//分别记录某种小写字母出现的个数 
int main()
{
	int n,i,a,j;
	while(scanf("%d",&n)!=EOF)
	{
		memset(big,0,sizeof(big));
		memset(lit,0,sizeof(lit));
		scanf("%s",str);
		int sum=0;
		for(i=0;i<n;++i)
		{
			if('a'<=str[i]&&str[i]<='z')//统计字符串中一共有多少种字符 
			{
				a=str[i]-'a';
				if(!lit[a])
				{
					sum++;
					lit[a]=1;
				}
			}
			else
			{
				a=str[i]-'A';
				if(!big[a])
				{
					sum++;
					big[a]=1;
				}
			}
		}
		int cnt=0;
		int start=0,ans=n;
		memset(big,0,sizeof(big));
		memset(lit,0,sizeof(lit));
		for(i=0;i<n;++i)
		{
			if('a'<=str[i]&&str[i]<='z')
			{
				a=str[i]-'a';
				if(!lit[a])
					cnt++;
				lit[a]++;
			}
			if('A'<=str[i]&&str[i]<='Z')
			{
				a=str[i]-'A';
				if(!big[a])
					cnt++;
				big[a]++;
			}
			if(cnt==sum)//子串包含所有字符种类时，子串首部往后移动，并记录最短的满足条件的子串长度 
			{
				while(cnt==sum)
				{
					if(i-start+1<ans)
						ans=i-start+1;
					if('a'<=str[start]&&str[start]<='z')
					{
						a=str[start]-'a';
						lit[a]--;
						if(!lit[a])
							cnt--;
					}
					if('A'<=str[start]&&str[start]<='Z')
					{
						a=str[start]-'A';
						big[a]--;
						if(!big[a])
							cnt--;
					}
					start++;
				}
			}
		} 
		printf("%d\n",ans);
	}
	return 0;
}