ybtoj+D. 【例题4】子串拆分(贪心+KMP）

思路：枚举左右子串长度，以此KMP；

方法：如果超过区间，j=ne[j];

code:

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 150010;
char s[N];
int n, k, ans = 0, ne[N];
void work(char s[]) {
    for (int i = 2, j = 0; i <= n; i++) {
        while (j && s[i] != s[j + 1]) j = ne[j];
        if (s[i] == s[j + 1])
            j++;
        ne[i] = j;
    }
    for (int i = 2, j = 0; i <= n; i++) {
        while (j && s[i] != s[j + 1]) j = ne[j];
        if (s[i] == s[j + 1])
            j++;
        while (j * 2 >= i) {//已解释
            j = ne[j];
        }
        if (j >= k)//符合条件，ans++
            ans++;
    }
}
int main() {
    memset(ne, 0, sizeof ne);
    scanf("%s%d", s + 1, &k);
    n = strlen(s + 1);
    int m = strlen(s + 1) - k * 2;
    for (int i = 0; i < m; i++) {
        work(s + i);//枚举一个B，一个A

    }
    cout << ans << endl;
}