LCP裸题
维护LCP之后要做个DP
参考Height的性质
由于是区间min所以维护单调栈
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef int INT;
#define int long long
const int N=1e6+100;
char S[N]={};
int x[N]={};
int y[N]={};
int SA[N]={};
int c[N]={};
int n,m;
void Get_SA(){
for(int i=1;i<=n;++i)x[i]=S[i];
for(int i=1;i<=n;++i)++c[x[i]];
for(int i=1;i<=m;++i)c[i]+=c[i-1];
for(int i=n;i>=1;i--)SA[c[x[i]]--]=i;
for(int k=1;k<=n;k=k<<1){
int num=0;
for(int i=n-k+1;i<=n;++i)y[++num]=i;
for(int i=1;i<=n;++i)if(SA[i]>k)y[++num]=SA[i]-k;
for(int i=1;i<=m;++i)c[i]=0;
for(int i=1;i<=n;++i)++c[x[i]];
for(int i=1;i<=m;++i)c[i]+=c[i-1];
for(int i=n;i>=1;i--)SA[c[x[y[i]]]--]=y[i],y[i]=0;
swap(x,y);
x[SA[1]]=1;num=1;
for(int i=2;i<=n;++i)x[SA[i]]=(y[SA[i]]==y[SA[i-1]]&&y[SA[i]+k]==y[SA[i-1]+k])?num:++num;
if(num==n)break;
m=num;
}
}
int rk[N]={};
int height[N]={};
void Get_Height(){
for(int i=1;i<=n;++i)rk[SA[i]]=i;
int k=0;
for(int i=1;i<=n;++i){
if(rk[i]==1)continue;
if(k)k--;
int Id=SA[rk[i]-1];
while(Id+k<=n&&i+k<=n&&S[Id+k]==S[i+k])++k;
height[rk[i]]=k;
}
}
int St[N*2];
int F[N];
int top=0;
void Solve(){
for(int i=1;i<=n;++i){
while(top&&height[St[top]]>height[i])top--;
F[i]=(i-St[top])*height[i]+F[St[top]];
St[++top]=i;
}
int ans=0;
for(int i=1;i<=n;++i)ans+=(3*i)*(i-1)/2;
for(int i=2;i<=n;++i)ans-=F[i]*2;
cout<<ans;
}
INT main(){
// freopen("test.in","r",stdin);
m=200;
scanf("%s",S+1);
n=strlen(S+1);
Get_SA();
Get_Height();
Solve();
}