#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#define PB push_back
using namespace std;
typedef long long ll;
const int N = 3e5 + 500;
const int INF = 0x3f3f3f3f;
struct node{
node* CH[30];
node* bk;
int len, cnt;
} *n0, *n1;
bool cmp(node* X, node* Y){
return X -> len > Y -> len;
}
string s;
int n;
ll mx;
vector < node* > v;
void precompute(){
n1 = new node(); n0 = new node();
n1 -> len = -1, n0 -> len = 0;
n0 -> bk = n1; n1 -> bk = n1;
node* cur = n0;
for(int i = 0;i < n;i++){
for(; cur->len + 1 > i || s[i - cur->len - 1] != s[i]; cur = cur -> bk);
node *rmb = cur -> bk;
if(cur -> CH[s[i] - 'a'] == NULL)
cur -> CH[s[i] - 'a'] = new node(), v.PB(cur -> CH[s[i] - 'a']);
cur -> CH[s[i] - 'a'] -> len = cur -> len + 2;
cur = cur -> CH[s[i] - 'a'];
cur -> cnt++;
//printf("len = %d\n", cur -> len);
for(; rmb -> len + 1 > i || s[i - rmb->len - 1] != s[i]; rmb = rmb -> bk);
if(cur -> len == 1)
cur -> bk = n0;
else{
if(rmb -> CH[s[i] - 'a'] == NULL)
rmb -> CH[s[i] - 'a'] = new node(), v.PB(rmb -> CH[s[i] - 'a']);
cur -> bk = rmb -> CH[s[i] - 'a'];
}
//printf("bk = %d\n", cur -> bk -> len);
}
}
int main(){
cin >> s;
n = (int)s.size();
precompute();
sort(v.begin(), v.end(), cmp);
for(int i = 0;i < v.size();i++){
mx = max(mx, (ll)v[i] -> len * v[i] -> cnt);
v[i] -> bk -> cnt += v[i] -> cnt;
}
cout << mx << endl;
}
Compilation message
palindrome.cpp: In function 'int main()':
palindrome.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | for(int i = 0;i < v.size();i++){
| ~~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
344 KB |
Output is correct |
22 |
Correct |
0 ms |
348 KB |
Output is correct |
23 |
Correct |
0 ms |
348 KB |
Output is correct |
24 |
Correct |
0 ms |
348 KB |
Output is correct |
25 |
Correct |
0 ms |
348 KB |
Output is correct |
26 |
Correct |
0 ms |
348 KB |
Output is correct |
27 |
Correct |
0 ms |
348 KB |
Output is correct |
28 |
Correct |
0 ms |
348 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Correct |
0 ms |
348 KB |
Output is correct |
31 |
Correct |
1 ms |
348 KB |
Output is correct |
32 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
604 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
0 ms |
604 KB |
Output is correct |
4 |
Correct |
0 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
0 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
604 KB |
Output is correct |
8 |
Correct |
0 ms |
604 KB |
Output is correct |
9 |
Correct |
1 ms |
600 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3160 KB |
Output is correct |
2 |
Correct |
3 ms |
3164 KB |
Output is correct |
3 |
Correct |
2 ms |
3164 KB |
Output is correct |
4 |
Correct |
3 ms |
3164 KB |
Output is correct |
5 |
Correct |
3 ms |
3164 KB |
Output is correct |
6 |
Correct |
3 ms |
3164 KB |
Output is correct |
7 |
Correct |
3 ms |
3164 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
2 ms |
2136 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
27732 KB |
Output is correct |
2 |
Correct |
26 ms |
27732 KB |
Output is correct |
3 |
Correct |
20 ms |
27732 KB |
Output is correct |
4 |
Correct |
27 ms |
27844 KB |
Output is correct |
5 |
Correct |
27 ms |
27732 KB |
Output is correct |
6 |
Correct |
17 ms |
20308 KB |
Output is correct |
7 |
Correct |
19 ms |
23716 KB |
Output is correct |
8 |
Correct |
3 ms |
604 KB |
Output is correct |
9 |
Correct |
6 ms |
6748 KB |
Output is correct |
10 |
Correct |
21 ms |
23632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
67 ms |
82952 KB |
Output is correct |
2 |
Correct |
79 ms |
83516 KB |
Output is correct |
3 |
Correct |
70 ms |
84656 KB |
Output is correct |
4 |
Correct |
84 ms |
83172 KB |
Output is correct |
5 |
Correct |
109 ms |
83028 KB |
Output is correct |
6 |
Correct |
71 ms |
75548 KB |
Output is correct |
7 |
Correct |
65 ms |
68844 KB |
Output is correct |
8 |
Correct |
7 ms |
1016 KB |
Output is correct |
9 |
Correct |
7 ms |
1016 KB |
Output is correct |
10 |
Correct |
69 ms |
67820 KB |
Output is correct |
11 |
Correct |
71 ms |
84456 KB |
Output is correct |
12 |
Correct |
15 ms |
8440 KB |
Output is correct |