#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 int mx=300000;
int nxt[mx][26];
int len[mx],link[mx];
int node,t;
string str;
void pre()
{
len[1]=-1,len[2]=0;
link[1]=link[2]=1;
node=t=2;
}
int cal[mx];
void add(int p)
{
while(str[p-len[t]-1]!=str[p]) t=link[t];
int x=link[t];
while(str[p-len[x]-1]!=str[p]) x=link[x];
int 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()
{
cin>>str;
pre();
for(int i=0;i<str.size();i++) add(i);
for(int i=node;i>=3;i--) cal[link[i]]+=cal[i];
int ans=-1;
for(int i=3;i<=node;i++)
{
ans=max(ans,len[i]*cal[i]);
}
cout<<ans<<endl;
}
Compilation message
palindrome.cpp: In function 'int main()':
palindrome.cpp:41:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<str.size();i++) add(i);
~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 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 |
632 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
504 KB |
Output is correct |
6 |
Correct |
2 ms |
504 KB |
Output is correct |
7 |
Correct |
2 ms |
504 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 |
4 ms |
1656 KB |
Output is correct |
2 |
Correct |
4 ms |
1448 KB |
Output is correct |
3 |
Correct |
4 ms |
1528 KB |
Output is correct |
4 |
Correct |
4 ms |
1528 KB |
Output is correct |
5 |
Correct |
4 ms |
1528 KB |
Output is correct |
6 |
Correct |
4 ms |
1528 KB |
Output is correct |
7 |
Correct |
4 ms |
1528 KB |
Output is correct |
8 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
12152 KB |
Output is correct |
2 |
Correct |
22 ms |
11960 KB |
Output is correct |
3 |
Incorrect |
23 ms |
12024 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
126 ms |
70548 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |