-
Notifications
You must be signed in to change notification settings - Fork 0
/
701C.cpp
60 lines (51 loc) · 955 Bytes
/
701C.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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
ll n;
cin >> n;
string s;
cin >> s;
int l = s.length();
map < char , int > m;
int count = 0;
for(int i = 0; i< n ; i ++)
{
if(m.find(s[i]) == m.end())
{
count ++;
m[s[i]] = 1;
}
else
m[s[i]]++;
}
int i = 0;
int j = 0;
int total = 0;
int m1[257] = {0};
int ans = INT_MAX;
while( i < l && j < l)
{
while(j < l && total!=count)
{
if(m1[s[j]] == 0)
{
total ++;
}
m1[s[j]]++;
j++;
}
ans = min(ans , j - i);
while(total == count && i <=j)
{
m1[s[i]]--;
ans = min(ans , j- i);
if(m1[s[i]] == 0)
total --;
i++;
}
}
cout << ans << endl;
}