CodeForces 701C They Are Everywhere

//http://codeforces.com/problemset/problem/701/C



//尺取法



#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
#include <functional>
#include <vector>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <sstream>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
int main()
{
    cin.sync_with_stdio(false);
    int N;
    char Str[100005];
    bool Flag1[150]={0};
    int Flag2[150]={0};
    int Total=0;
    cin>>N>>(Str+1);
    for (int i=1;i<=N;i++)
        if (!Flag1[Str[i]])
            Total++,Flag1[Str[i]]=true;
    int Ans=N,first=1,last=1,current=0;
    while (true)
    {
        while (last<=N&&current<Total)
        {
            if (!Flag2[Str[last]])
                current++;
            Flag2[Str[last]]++,last++;
        }
        if (current<Total)
            break;
        Ans=min(Ans,last-first);
        if (Flag2[Str[first]]==1)
            current--;
        Flag2[Str[first]]--,first++;
    }
    cout<<Ans;
    return 0;
}