后缀自动机 SAM
struct NODE
{
int ch[26];
int len,fa;
NODE(){memset(ch,0,sizeof(ch));len=0;}
}dian[MAXN<<1];
int las=1,tot=1;
void add(int c)
{
int p=las;int np=las=++tot;
dian[np].len=dian[p].len+1;
for(;p&&!dian[p].ch[c];p=dian[p].fa)dian[p].ch[c]=np;
if(!p)dian[np].fa=1;//以上为case 1
else
{
int q=dian[p].ch[c];
if(dian[q].len==dian[p].len+1)dian[np].fa=q;//以上为case 2
else
{
int nq=++tot;dian[nq]=dian[q];
dian[nq].len=dian[p].len+1;
dian[q].fa=dian[np].fa=nq;
for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;//以上为case 3
}
}
}
char s[MAXN];int len;
int main()
{
scanf("%s",s);len=strlen(s);
for(int i=0;i
void add(int c)
{
int p=las;int np=las=++tot;
dian[np].len=dian[p].len+1;
```

```cpp
for(;p&&!dian[p].ch[c];p=dian[p].fa)dian[p].ch[c]=np;
if(!p)dian[np].fa=1;//以上为case 1`
else
{
int q=dian[p].ch[c];
if(dian[q].len==dian[p].len+1)dian[np].fa=q;
else
{
int nq=++tot;dian[nq]=dian[q];
dian[nq].len=dian[p].len+1;
dian[q].fa=dian[np].fa=nq;
for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;//以上为case 3
strcpy(dian[nq].ch,dian[q].ch);
dian[nq].fa=dian[q].fa;
for(;p&&!dian[p].ch[c];p=dian[p].fa)dian[p].ch[c]=np;
for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;
P3804 【模板】后缀自动机 (SAM)
#include
#include
#include
#include
#include
#include
using namespace std;
int tot=1,las=1;
struct NODE
{
int ch[26];
int len,fa;
NODE(){memset(ch,0,sizeof(ch));len=fa=0;}
}dian[2000010];
struct Edge
{
int t,nexty;
}edge[2000010];
int head[2000010],cnt=0;
void jia(int a,int b)
{
cnt++;
edge[cnt].t=b;
edge[cnt].nexty=head[a];
head[a]=cnt;
}
long long zhi[2000010];
inline void add(int c)
{
register int p=las,np=las=++tot;zhi[tot]=1;
dian[np].len=dian[p].len+1;
for(;p&&!dian[p].ch[c];p=dian[p].fa)dian[p].ch[c]=np;
if(!p)dian[np].fa=1;
else
{
register int q=dian[p].ch[c];
if(dian[q].len==dian[p].len+1)dian[np].fa=q;
else
{
register int nq=++tot;
dian[nq]=dian[q];dian[nq].len=dian[p].len+1;
dian[q].fa=dian[np].fa=nq;
for(;p&&dian[p].ch[c]==q;p=dian[p].fa)dian[p].ch[c]=nq;
}
}
}
char s[2000010];
int cd;
long long ans=0;
void dfs(int node)
{
for(register int i=head[node];i;i=edge[i].nexty)
{
dfs(edge[i].t);
zhi[node]+=zhi[edge[i].t];
}
if(zhi[node]!=1)ans=max(ans,zhi[node]*dian[node].len);
}
int main()
{
scanf("%s",s);cd=strlen(s);
for(register int i=0;i