hdu 5763 kmp + dp

分析:
乍一看以为很容斥,其实把它拆分成dp很容易解决重复.
根据数据量显然是一个一维$o(1)$转移的dp.
定义$dp[i]$表示以 i <script type="math/tex" id="MathJax-Element-3">i</script>结尾的种数,考虑依次添加字符,如果以当前结尾的后缀不构成模式串显然种数不增加,否则加上前面部分.
kmp简化的写法很强势.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct jibancanyang
{
    int n, m;
    char s[112345], p[112345];
    int nexts[112345], dp[112345];
    bool have[112345];

    void getnexts() {
        int k, j = 0;
        k = nexts[0] = -1;
        while (j < m) {
            if (k == -1 || p[j] == p[k]) nexts[++j] = ++k;
            else k = nexts[k];
        }
    }

    void kmp() {
        getnexts();
        memset(have, false, sizeof(have));
        int j = 0, k = 0;
        while (j < n) {
            if (k == -1 || s[j] == p[k]) j++, k++;
            else k = nexts[k];
            if (k == m) {
                k = nexts[k];
                have[j - 1] = true;
            }
        }
    }

    void fun() {
        int T, mod = static_cast<int>(1e9) + 7;
        scanf("%d", &T);
        for (int cas = 1; cas <= T; ++cas) {
            scanf("%s%s", s, p);
            n = strlen(s), m = strlen(p);
            kmp();
            for (int i = 0; i < n; i++) {
                long long k = i ? dp[i - 1] : 1;
                if (have[i]) k = ((i >= m ? dp[i - m] : 1) + k) % mod;
                dp[i] = k;
            }
            printf("Case #%d: %d\n", cas, dp[n - 1]);
        }
    }
}ac;

int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif // ONLINE_JUDGE
    ac.fun();
    return 0;
}