Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 33 KBi |
#2 |
Correcto
|
0.004 s | 2 KBi |
#3 |
Correcto
|
0.006 s | 24 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 2 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 25 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Correcto
|
0.012 s | 2 KBi |
#11 |
Correcto
|
0.009 s | 9 KBi |
#12 |
Correcto
|
0.009 s | 1 KBi |
#13 |
Correcto
|
0.009 s | 2 KBi |
#14 |
Correcto
|
0.008 s | 18 KBi |
#15 |
Correcto
|
0.01 s | 2 KBi |
#16 |
Correcto
|
0.011 s | 2 KBi |
#17 |
Correcto
|
0.009 s | 10 KBi |
#18 |
Correcto
|
0.009 s | 13 KBi |
#19 |
Correcto
|
0.007 s | 7 KBi |
#20 |
Correcto
|
0.01 s | 2 KBi |
#21 |
Correcto
|
0.012 s | 2 KBi |
#22 |
Correcto
|
0.015 s | 2 KBi |
#23 |
Correcto
|
0.009 s | 2 KBi |
#24 |
Correcto
|
0.009 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long #define pii pair<int, int> const int maxi = 1e9; int main(){ ios::sync_with_stdio(0); cin.tie(0); string s; cin>>s; int n; cin>>n; int ans = 1, i=0, j=1; int aux[26]; for(int i=0;i<26; i++){ aux[i]=0; } //abaca //abjjj aux[s[i]-'a']=1; int cont = 1; while(j<s.size()){ if(cont <= n){ if(aux[s[j]-'a']==0){ cont++; } //cout<<"i: "<<i<<"j: "<<j<<"cont: "<<cont<<endl; if(cont <= n){ ans = max(ans, j-i+1); } aux[s[j]-'a']++; j++; }else{ //cout<<"HOLA"<<endl; if(aux[s[i]-'a']==1){ cont--; } aux[s[i]-'a']--; i++; //cout<<"i: "<<i<<"j: "<<j<<"cont: "<<cont<<endl; } } //for(int i=0;i<s.size(); i++){ // int j=i+1; // aux.insert(s[i]); // while(j<s.size()){ // aux.insert(s[j]); // if(aux.size()<=n){ // ans = max(ans, j-i+1); // j++; // }else{ // break; // } // } // aux.clear(); //} cout<<ans<<endl; return 0; }