【BZOJ 3620】 似乎在梦中见过的样子

【题目链接】

https://www.lydsy.com/JudgeOnline/problem.php?id=3620

【算法】

KMP

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN 15010

int i,len,k,ans;
char s[MAXN];

inline void kmp(int pos)
{
        int i,j,tmp;
        static int nxt[MAXN];
        nxt[pos] = ;
        for (i = pos + ; i <= len; i++)
        {
                tmp = nxt[i-];
                while (tmp && s[i] != s[pos+tmp]) tmp = nxt[pos+tmp-];
                if (s[i] == s[pos+tmp]) tmp++;
                nxt[i] = tmp;
        }
        j = ;
        for (i = pos + ; i <= len; i++)
        {
                while (j && s[i] != s[pos+j]) j = nxt[pos+j-];
                if (s[i] == s[pos+j]) j++;
                while (j > (i - pos) / ) j = nxt[pos+j-];
                if (j >= k) ans++;
        }
}

int main()
{

        scanf("%s%d",s+,&k);
        len = strlen(s+);
        for (i = ; i <= len; i++) kmp(i);
        printf("%d\n",ans);

        return ;

}