hdu4641-K-string(后缀自动机)

https://vjudge.net/problem/HDU-4641
参考http://www.cnblogs.com/wust-ouyangli/p/5805461.html

自己貌似写炸了。。还是用用别人的这种方式.f

#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int maxn=500005;
int N,M,K;
struct SAM
{
    int ch[maxn][26];
    int pre[maxn],step[maxn];
    int last,id,ans;
    int num[maxn];
    void init()
    {
        ans=last=id=0;
        memset(ch[0],-1,sizeof(ch[0]));
        pre[0]=-1; step[0]=0;
    }
    void Insert(int c) 
    {
        int p=last,np=++id;
        step[np]=step[p]+1;
        memset(ch[np],-1,sizeof(ch[np])); num[np]=0;

        while(p!=-1&&ch[p][c]==-1)  ch[p][c]=np,p=pre[p];
        if(p==-1) pre[np]=0;
        else
        {
            int q=ch[p][c];
            if(step[q]!=step[p]+1)
            {
                int nq=++id;
                memcpy(ch[nq],ch[q],sizeof(ch[q])); num[nq]=num[q];
                step[nq]=step[p]+1;
                pre[nq]=pre[q];
                pre[np]=pre[q]=nq;
                while(p!=-1&&ch[p][c]==q) ch[p][c]=nq,p=pre[p];
            }
            else pre[np]=q;
        }
        last=np;

        while(np!=-1&&num[np]<K) //没有达到K次的就加1
        {
            num[np]++;
            if(num[np]>=K) ans+=step[np]-step[pre[np]]; //加上答案
            np=pre[np];
        }
    }
}sam;
char S[50005];
int main()
{
    while(scanf("%d%d%d",&N,&M,&K)!=EOF)
    {
        scanf("%s",S);
        sam.init();
        for(int i=0;i<N;i++) sam.Insert(S[i]-'a');
        int type;
        char c;
        while(M--)
        {
            scanf("%d",&type);
            if(type==1){ scanf(" %c",&c); sam.Insert(c-'a'); }
            else printf("%d\n",sam.ans);
        }
    }
    return 0;
}