Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.002 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.024 s | 1 KBi |
#11 |
Correcto
|
0.063 s | 1 KBi |
#12 |
Correcto
|
0.026 s | 1 KBi |
#13 |
Correcto
|
0.076 s | 1 KBi |
#14 |
Correcto
|
0.028 s | 1 KBi |
#15 |
Correcto
|
0.032 s | 1 KBi |
#16 |
Correcto
|
0.054 s | 1 KBi |
#17 |
Correcto
|
0.028 s | 2 KBi |
#18 |
Correcto
|
0.054 s | 1 KBi |
#19 |
Correcto
|
0.045 s | 1 KBi |
#20 |
Correcto
|
0.056 s | 1 KBi |
#21 |
Correcto
|
0.067 s | 1 KBi |
#22 |
Correcto
|
0.065 s | 1 KBi |
#23 |
Correcto
|
0.045 s | 1 KBi |
#24 |
Correcto
|
0.034 s | 1 KBi |
#include <bits/stdc++.h> using namespace std; int main(){ #if LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif string s; int k; cin >>s >> k; set<char> st; map<char, int> mp; int ans = -1; for (int l = 0, r =0; r < (int)s.size(); r++){ mp[s[r]]++; st.insert(s[r]); if (st.size() > k){ while (1){ mp[s[l]]--; if (mp[s[l]] == 0){ // Removed a character st.erase(s[l]); l++; break; } l++; } } ans = max(ans, r - l + 1); } cout << ans << endl; }