在线做法太爽了,代码少,速度快。用法基本跟普通sam一样!!
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int M=1e6+7;
struct SAM {
int maxlen[M*2], trans[M*2][26], link[M*2], tg[M*2], size, last;
SAM() {
size = last = 1;
memset(tg,0,sizeof(tg));//注意这里要初始化tg
}
inline void extend(int id) {//与普通sam的区别是多了2个特判
int flag=0,clone;
if(trans[last][id]&&maxlen[last]+1==maxlen[trans[last][id]]){//特判1
last=trans[last][id];
return ;
}
int cur = (++ size), p;
tg[cur]=1;//标记当前点,表示当前集合包含原串的前缀
maxlen[cur] = maxlen[last] + 1;
for (p = last; p && !trans[p][id]; p = link[p]) trans[p][id] = cur;
if (!p) link[cur] = 1;
else {
if(maxlen[p]+1==maxlen[cur])flag=1;//(特判2)
int q = trans[p][id];
if (maxlen[q] == maxlen[p] + 1) link[cur] = q;
else {
clone = (++ size);
maxlen[clone] = maxlen[p] + 1;
for(int i=0;i<26;i++)trans[clone][i]=trans[q][i];
link[clone] = link[q];
for (; p && trans[p][id] == q; p = link[p]) trans[p][id] = clone;
link[cur] = link[q] = clone;
}
}
last = flag?clone:cur;
}
inline void gao(){
ll ans=0;
for(int i=2;i<=size;++i)ans+=maxlen[i]-maxlen[link[i]];
printf("%lld\n",ans);
}
}sam;
char s[M];
int main(){
int n ;
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%s",s+1);
int len=strlen(s+1);
sam.last=1;//每个串加完后last置为1
for(int j=1;j<=len;j++)
sam.extend(s[j]-'a');
}
sam.gao();
return 0;
}