-
Notifications
You must be signed in to change notification settings - Fork 5
/
CodeForces 701C - They Are Everywhere.cpp
46 lines (35 loc) · 1.11 KB
/
CodeForces 701C - They Are Everywhere.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define inc(a) a.begin(), a.end()
#define dec(a) a.rbegin(), a.rend()
#define Unique(n) (n).erase(unique(inc(n)), (n).end())
#define what_is(x) cerr << #x << " is " << x << '\n';
#define to(i, a, n) for(int i=a; i<n; i++)
#define fr(i, a, n) for(int i=a; i>=n; i--)
#define read(arr, l, r) for(int i=l; i<r; cin >> arr[i++])
#define prnt(arr, l, r) for(int i=l; i<r; cout << arr[i++] << " \n"[i==r])
typedef long long ll;
typedef long double ld;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string s; cin >> n >> s;
int l, r, mini, cur, tot;
l = r = cur = 0, mini = n;
map<char, int> mp;
to(i, 0, n) mp[s[i]];
tot = mp.size(), mp.clear();
while(l<=r){
while(cur!=tot && r<n)
mp[s[r++]]++, cur = mp.size();
if(cur==tot) mini = min(mini, r-l);
if(mp[s[l]]==1) cur--, mp.erase(s[l++]);
else mp[s[l++]]--;
}
cout << mini;
return 0;
}