后缀自动机模板

出自kuangbin模板

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int CHAR=26;
const int MAXN=100000+10;
struct SAM_Node
{
	SAM_Node *fa,*next[CHAR];
	int len;
	int id,pos;
	SAM_Node(){}
	SAM_Node(int _len)
	{
		fa=0;
		len=_len;
		memset(next,0,sizeof(next));
	}
};
SAM_Node SAM_node[MAXN*2],*SAM_root,*SAM_last;
int SAM_size;
SAM_Node *newSAM_Node(int len)
{
	SAM_node[SAM_size]=SAM_Node(len);
	SAM_node[SAM_size].id=SAM_size;
	return &SAM_node[SAM_size++];
}
SAM_Node *newSAM_Node(SAM_Node *p)
{
	SAM_node[SAM_size]=*p;
	SAM_node[SAM_size].id=SAM_size;
	return &SAM_node[SAM_size++];
}
void SAM_init()
{
	SAM_size=0;
	SAM_root=SAM_last=newSAM_Node(0);
	SAM_node[0].pos=0;
}
void SAM_add(int x,int len)
{
	SAM_Node *p=SAM_last,*np=newSAM_Node(p->len+1);
	np->pos=len;
	SAM_last=np;
	for(;p&&!p->next[x];p=p->fa)
		p->next[x]=np;
	if(!p)
	{
		np->fa=SAM_root;
		return;
	}
	SAM_Node *q=p->next[x];
	if(q->len==p->len+1)
	{
		np->fa=q;
		return;
	}
	SAM_Node *nq=newSAM_Node(q);
	nq->len=p->len+1;
	q->fa=nq;
	np->fa=nq;
	for(;p&&p->next[x]==q;p=p->fa)
		p->next[x]=nq;
}
void SAM_build(char *s)
{
	SAM_init();//prt(0);
	int len=strlen(s);
	for(int i=0;i<len;i++)
		SAM_add(s[i]-'a',i+1);//prt(i+1);
}
//加入串后进行拓扑排序
char str[MAXN];
int topocnt[MAXN];
SAM_Node *topsam[MAXN*2];
void solve()
{
	int n=strlen(str);
	SAM_build(str);
	memset(topocnt,0,sizeof(topocnt));
	for(int i=0;i<SAM_size;i++)
		topocnt[SAM_node[i].len]++;
	for(int i=1;i<=n;i++)
		topocnt[i]+=topocnt[i-1];
	for(int i=0;i<SAM_size;i++)
		topsam[--topocnt[SAM_node[i].len]]=&SAM_node[i];
}
/*
//多串的建立，注意SAM_init()的调用
void SAM_builds(char *s)
{
	int len=strlen(s);
	SAM_last=SAM_root;
	for(int i=0;i<len;i++)
		if(!SAM_last->next[s[i]-'0']||!(SAM_last->next[s[i]-'0']->len==i+1))
			SAM_add(s[i]-'0',i+1);
		else SAM_last=SAM_last->next[s[i]-'0'];
}*/

64位系统中指针占用空间比int大，所以省去指针占用空间更小

下面是HDU-6194题目的代码，可以套用模板

#include <cstdio>
#include<iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=200010; 
char s[N];
struct SAM{
    int p,q,np,nq,cnt,lst,a[N][26],l[N],f[N],tot;
    int Tr(char c){return c-'a';}
    int val(int c){return l[c]-l[f[c]];} 
    SAM(){cnt=0;lst=++cnt;}
    void Initialize(){
        memset(l,0,sizeof(int)*(cnt+1));
        memset(f,0,sizeof(int)*(cnt+1));
        for(int i=0;i<=cnt;i++)for(int j=0;j<26;j++)a[i][j]=0;
        cnt=0;lst=++cnt;
    }
    void extend(int c){
        p=lst;np=lst=++cnt;l[np]=l[p]+1;
        while(!a[p][c]&&p)a[p][c]=np,p=f[p];
        if(!p){f[np]=1;}
        else{
            q=a[p][c];
            if(l[p]+1==l[q])f[np]=q;
            else{
                nq=++cnt;l[nq]=l[p]+1;
                memcpy(a[nq],a[q],sizeof(a[q]));
                f[nq]=f[q]; f[np]=f[q]=nq;
                while(a[p][c]==q)a[p][c]=nq,p=f[p];
            }
        }
    }
    int b[N],x[N],r[N];
    void build(int len){
        Initialize();
        for(int i=1;i<=len;i++)extend(Tr(s[i]));
    }
    void solve(){
        int ans=0,k;
        scanf("%d",&k);
        scanf("%s",s+1); //从下标1开始
        int len=strlen(s+1);
        build(len);
        memset(r,0,sizeof(int)*(cnt+1));
        memset(b,0,sizeof(int)*(cnt+1));
        for(int i=1;i<=cnt;i++)b[l[i]]++;
        for(int i=1;i<=len;i++)b[i]+=b[i-1];
        for(int i=1;i<=cnt;i++)x[b[l[i]]--]=i;
        for(int i=p=1;i<=len;i++){p=a[p][Tr(s[i])];r[p]++;}
        for(int i=cnt;i;i--)r[f[x[i]]]+=r[x[i]];
        for(int i=1;i<=cnt;i++)if(r[x[i]]==k)ans+=val(x[i]);
        printf("%d\n",ans);
    }
}sam;
int T;
int main(){
    scanf("%d",&T);
    while(T--){
        sam.solve();
    }return 0;
}