Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.01 s | 6 KBi |
#2 |
Correcto
|
0.015 s | 5 KBi |
#3 |
Correcto
|
0.013 s | 5 KBi |
#4 |
Correcto
|
0.01 s | 5 KBi |
#5 |
Correcto
|
0.011 s | 5 KBi |
#6 |
Correcto
|
0.014 s | 5 KBi |
#7 |
Correcto
|
0.014 s | 6 KBi |
#8 |
Correcto
|
0.019 s | 5 KBi |
#9 |
Correcto
|
0.015 s | 6 KBi |
#10 |
Correcto
|
0.015 s | 5 KBi |
#11 |
Correcto
|
0.021 s | 6 KBi |
#12 |
Correcto
|
0.016 s | 6 KBi |
#13 |
Correcto
|
0.016 s | 5 KBi |
#14 |
Correcto
|
0.017 s | 6 KBi |
#15 |
Incorrecto
|
0.017 s | 5 KBi |
#16 |
Incorrecto
|
0.019 s | 6 KBi |
#17 |
Correcto
|
0.015 s | 5 KBi |
#18 |
Incorrecto
|
0.017 s | 5 KBi |
#19 |
Incorrecto
|
0.016 s | 5 KBi |
#20 |
Incorrecto
|
0.014 s | 5 KBi |
#21 |
Correcto
|
0.017 s | 5 KBi |
#22 |
Correcto
|
0.014 s | 5 KBi |
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long #define pii pair<int, int> const int maxi = 1e6; vector<int>kmp(maxi); int main(){ ios::sync_with_stdio(0); cin.tie(0); string s; cin>>s; int ans = 0; for(int i=1;i<s.size();i++){ int j = kmp[i-1]; while(j>0 && s[i] != s[j]){ j= kmp[j-1]; } if(s[i] == s[j]){ j++; } ans = max(ans, j); kmp[i] = j; } cout<<ans<<endl; // cout<<kmp[s.size()-1]<<endl; return 0; }