Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.007 s | 6 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.009 s | 66 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.01 s | 1 KBi |
#12 |
Correcto
|
0.013 s | 31 KBi |
#13 |
Correcto
|
0.013 s | 3 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Incorrecto
|
0.008 s | 14 KBi |
#16 |
Incorrecto
|
0.005 s | 1 KBi |
#17 |
Correcto
|
0.004 s | 1 KBi |
#18 |
Incorrecto
|
0.004 s | 1 KBi |
#19 |
Incorrecto
|
0.014 s | 31 KBi |
#20 |
Incorrecto
|
0.004 s | 1 KBi |
#21 |
Correcto
|
0.01 s | 64 KBi |
#22 |
Correcto
|
0.009 s | 65 KBi |
#include <algorithm> #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 n = s.size(); vi ps(n, 0); for (int i = 1; i < n; i++) { int j = ps[i - 1]; while (j > 0 && s[i] != s[j]){ j = ps[j-1]; } if(s[i] == s[j]) j++; ps[i] = j; } cout<<*max_element(ps.begin(),ps.end())<<endl; return 0; }