Codeforces Round #364 (Div. 2)C

C. They Are Everywhere

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
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.

看代码吧~

/*
 题意就是求一个最短连续区间长度包含给定字符串的所有种类。

 经典尺取法。

 先O(n)求出总共有多少种字符num。

 把字符一个一个加到队列，统计队列里面的字符种数。

 不够num，继续加入。

 如果够了，更新ans=min（ans，Q.size()）。

 将第一个字符出队，重复上述操作。
 */
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
int flag[300];
using namespace std;
int main (void)
{
    int num=0,n;
    queue <char> qu;
    string ch;
    cin>>n>>ch;
    for(int i=0;i<ch.size();i++)
    {
        if(!flag[ch[i]])
        {
            num++;//统计字符串种数
            flag[ch[i]]=1;
        }
    }
    memset(flag,0,sizeof(flag));
    int t=0,ans=n+1;
    for(int i=0;i<ch.size();i++)
    {
        if(t<num)
        {
            qu.push(ch[i]);//入队
            if(!flag[ch[i]])
            {
                t++;//当前多少种
            }
            flag[ch[i]]++;//当前这类字符有多少个
        }
        if(t==num)//当种数够了
        {
            while(!qu.empty()&&flag[qu.front()]>1)
                //有大于一个这种字符
            {
                flag[qu.front()]--;//减剩一个
                qu.pop();//出队
            }
            ans=min(ans,(int)qu.size());
            flag[qu.front()]--;
            qu.pop();
            t--;
        }
    }
    printf("%d\n",ans);
    return 0;
}