卡着时限过的…
时间大概是垫底一般的存在把…
容易想到马拉车处理回文串(不过这题大佬都是回文自动机啥的。。。
然后考虑相同的串一定是sa上h数组连续的一段,那么二分左右端点即可.
然后扫一遍就求出了答案
c++代码如下:
#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y ; ++ i)
#define repd(i,x,y) for(register int i = x; i >= y ; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T& x)
{
x = 0;char c;int sign = 1;
do { c = getchar(); if(c == '-') sign = - 1; }while(!isdigit(c));
do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
x *= sign;
}
const int N = 6e5 + 500;
char s[N];int n;
int sa[N],buc[N],rk[N],h[N],x[N],y[N];
inline void get_sa()
{
int m = 255;
rep(i,1,n) ++buc[x[i] = s[i]];
rep(i,1,m) buc[i] += buc[i - 1];
repd(i,n,1) sa[buc[x[i]]--] = i;
for(register int k = 1;k <= n ; k <<= 1)
{
int p = 0;
repd(i,n,n - k + 1) y[++p] = i;
rep(i,1,n) if(sa[i] > k) y[++p] = sa[i] - k;
rep(i,1,m) buc[i] = 0;
rep(i,1,n) ++buc[x[i]];
rep(i,1,m) buc[i] += buc[i-1];
repd(i,n,1) sa[buc[x[y[i]]]--] = y[i];
swap(x,y); x[sa[1]] = 1;
p = 1;
rep(i,2,n)
if(y[sa[i]] == y[sa[i-1]] && y[sa[i] + k] == y[sa[i-1]+k]) x[sa[i]] = p;
else x[sa[i]] = ++p;
if(p >= n) break;
m = p;
}
int p = 0;
rep(i,1,n) rk[sa[i]] = i;
rep(i,1,n)
{
if(rk[i] == 1) continue;
int t = sa[rk[i] - 1];
while(t + p <= n && i + p <= n&& s[i + p] == s[t + p]) ++p;
h[rk[i]] = p;
p = max(0,p - 1);
}
}
int st[N][21],lg[N];
inline void pre(int n)
{
rep(i,1,n) lg[i] = lg[i>>1] + 1;
rep(i,1,n) st[i][0] = h[i];
rep(j,1,20) rep(i,1,n)
if(i + (1<<j-1) <= n)st[i][j] = min(st[i][j-1],st[i+(1<<j-1)][j-1]);
}
inline int query(int l,int r)
{
int k = lg[r - l + 1] - 1;
return min(st[l][k],st[r - (1 << k) + 1][k]);
}
int len ;
ll find(int x,int c)
{
int l = 2,z = rk[x],r = len,mid;
while(l <= z)
{
if(query(mid = l + z >> 1,rk[x]) >= c) z = mid - 1;
else l = mid + 1;
}
z = rk[x] + 1;
while(z <= r)
{
if(query(rk[x] + 1,mid = z + r >> 1) >= c) z = mid + 1;
else r = mid - 1;
}
ll ans = max(0,rk[x] - l + 1) + max(0,r - (rk[x] + 1) + 1) + 1;
return ans * c;
}
ll ans ;
int id,p[N];
int P[N];
int main()
{
scanf("%s",s+1);
n = strlen(s+1);
len = n;
get_sa();
repd(i,2*n,1)
if(i&1) s[i] = '#';
else s[i] = s[i>>1];
n <<= 1; s[0] = '$';
s[n + 1] = '#';s[n+2] = '%';
rep(i,1,n)
{
if(p[id] + id > i) p[i] = min(p[id] + id - i,p[(id<<1) - i]);
else p[i] = 1;
while(s[p[i] + i] == s[i - p[i]]) ++ p[i];
if(p[i] + i > p[id] + id) id = i;
}
pre(len);
rep(i,1,n) P[(i-(p[i]-1) + 1)>>1] = max(P[(i-(p[i]-1) + 1)>>1],p[i]-1);
rep(i,1,len) ans = max(ans,find(i,P[i]));
cout << ans << endl;
return 0;
}