#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define filein freopen("input.txt","r",stdin)
#define fileout freopen("output.txt","w",stdout)
using namespace std;
const ll mx=1000009;
ll nxt[mx][26];
ll len[mx],link[mx];
ll node,t;
string str;
void pre()
{
len[1]=-1,len[2]=0;
link[1]=link[2]=1;
node=t=2;
}
ll cal[mx];
void add(ll p)
{
while(str[p-len[t]-1]!=str[p]) t=link[t];
ll x=link[t];
while(str[p-len[x]-1]!=str[p]) x=link[x];
ll c=str[p]-'a';
if(nxt[t][c]==false)
{
nxt[t][c]=++node;
len[node]=len[t]+2;
link[node]=(len[node]==1)? 2: nxt[x][c];
}
t=nxt[t][c] ;
cal[node]++;
}
int main()
{
fast;
cin>>str;
pre();
for(ll i=0;i<(int)str.size();i++) add(i);
for(ll i=node;i>=3;i--) cal[link[i]]+=cal[i];
ll ans=0;
for(ll i=3;i<=node;i++)
{
ans=max(ans,len[i]*cal[i]);
}
cout<<ans<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
632 KB |
Output is correct |
3 |
Correct |
2 ms |
632 KB |
Output is correct |
4 |
Correct |
2 ms |
632 KB |
Output is correct |
5 |
Correct |
2 ms |
504 KB |
Output is correct |
6 |
Correct |
2 ms |
632 KB |
Output is correct |
7 |
Correct |
2 ms |
632 KB |
Output is correct |
8 |
Correct |
2 ms |
504 KB |
Output is correct |
9 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
2680 KB |
Output is correct |
2 |
Correct |
5 ms |
2680 KB |
Output is correct |
3 |
Correct |
5 ms |
2680 KB |
Output is correct |
4 |
Correct |
5 ms |
2680 KB |
Output is correct |
5 |
Correct |
5 ms |
2680 KB |
Output is correct |
6 |
Correct |
5 ms |
2680 KB |
Output is correct |
7 |
Correct |
5 ms |
2680 KB |
Output is correct |
8 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
23268 KB |
Output is correct |
2 |
Correct |
30 ms |
23296 KB |
Output is correct |
3 |
Correct |
30 ms |
23220 KB |
Output is correct |
4 |
Correct |
30 ms |
23288 KB |
Output is correct |
5 |
Correct |
34 ms |
23320 KB |
Output is correct |
6 |
Incorrect |
24 ms |
17144 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
84 ms |
68864 KB |
Output is correct |
2 |
Incorrect |
85 ms |
68864 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |