Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 14 KBi |
#3 |
Correcto
|
0.004 s | 0 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 10 KBi |
#6 |
Correcto
|
0.006 s | 7 KBi |
#7 |
Correcto
|
0.001 s | 0 KBi |
#8 |
Correcto
|
0.008 s | 48 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.045 s | 1 KBi |
#11 |
Correcto
|
0.086 s | 1 KBi |
#12 |
Correcto
|
0.037 s | 1 KBi |
#13 |
Correcto
|
0.09 s | 1 KBi |
#14 |
Correcto
|
0.049 s | 1 KBi |
#15 |
Correcto
|
0.038 s | 1 KBi |
#16 |
Incorrecto
|
0.019 s | 1 KBi |
#17 |
Correcto
|
0.012 s | 1 KBi |
#18 |
Correcto
|
0.066 s | 1 KBi |
#19 |
Correcto
|
0.02 s | 1 KBi |
#20 |
Incorrecto
|
0.026 s | 1 KBi |
#21 |
Correcto
|
0.051 s | 1 KBi |
#22 |
Incorrecto
|
0.018 s | 1 KBi |
#23 |
Correcto
|
0.019 s | 1 KBi |
#24 |
Correcto
|
0.034 s | 1 KBi |
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<n;i++) #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } const lli mod=(1e9)+7; const int N = 1e4+1; int main(){ fast_io; string s;cin>>s; int k;cin>>k; int n = s.size(); map<char,int> m; int l = 0; int r = 0; int ans = 0; int tam = 0; set<char> box; int p = 0; while(l<=r && r<n && p<=5){ //p++; while(box.size()<=k && r<n){ if((box.find(s[r])==box.end()) && box.size()==k)break; box.insert(s[r]); tam++; m[s[r]] = r; //cout<<s[r]<<endl; r++; } //cout<<"sale tam: "<<tam<<endl; //cout<<"cord "<<l<<" : "<<r<<endl; if(box.size()>=k){ ans = max(ans,tam); box.erase(s[l]); l = m[s[l]] + 1; tam = r - l ; } ans = max(ans,tam); //cout<<"post cord "<<l<<" : "<<r<<endl; //if(box.size()>k)cout<<"Sth wnet wrong"<<endl; } cout<<ans<<endl;; return 0; }