HDU 5763 Another Meaning （DP+KMP||后缀数组）

题意：给你两个字符串，A,B，A中每一个B字符串都有两种意思，问A总共可以有多少种意思。|A|,|B| <=1e5

思路：可以想到dp[i]表示长度为i的A串的含有的方案数，那么可以得到转移方程dp[i] = dp[i-1], 如果i字符与前面的

lenB-1个字符能构成B串， 那么再加上dp[i-lenB].

关键是怎么判断A串第i个字符结尾是否跟B串匹配，既然字符串匹配，那就可以用kmp，kmp匹配时每次匹配成功在成

功的位置打上标记，这样就知道第i个字符结尾是否与B匹配。

如果没能想到kmp标记，其实也可以用后缀数组，判断下strA[i-len+1, i]与strB是否匹配只需要看下他们的LCP是否为lenB即可。

kmp代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
const int mod = 1e9+7;
char str1[maxn], str2[maxn];
int Next[maxn], isE[maxn];
int dp[maxn];

void makeNext(char *s)
{
    int len = strlen(s);
    Next[0] = Next[1] = 0;
    for(int i = 1; i < len; i++)
    {
        int j = Next[i];
        while(j && s[i] != s[j]) j = Next[j];
        Next[i+1] = s[i]==s[j] ? j+1 : 0;
    }
}

void kmp(char *s, char *t)
{
    int len1 = strlen(s);
    int len2 = strlen(t);
    int i, j = 0;
    for(int i = 0; i < len1; i++)
    {
        while(j && s[i]!=t[j]) j = Next[j];
        if(s[i] == t[j]) j++;
        if(j == len2) isE[i] = 1, j = Next[j];
    }
}

int main(void)
{
    int _, ca = 1;
    cin >> _;
    while(_--)
    {
        scanf(" %s%s", str1, str2);
        memset(isE, 0, sizeof(isE));
        memset(dp, 0, sizeof(dp));
        makeNext(str1);
        kmp(str1, str2);
        dp[0] = 1;
        int len1 = strlen(str1);
        int len2 = strlen(str2);
        for(int i = 1; i <= len1; i++)
        {
            dp[i] = dp[i-1];
            if(isE[i-1])
                dp[i] = (dp[i]+dp[i-len2])%mod;
        }
        printf("Case #%d: %d\n", ca++, dp[len1]);
    }
    return 0;
}

后缀数组代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5+5;
int t1[maxn], t2[maxn], c[maxn];
int ra[maxn], height[maxn];
int sa[maxn];
char str1[maxn], str2[maxn];
char str[maxn];

bool cmp(int *r, int a, int b, int l)
{
    return r[a]==r[b]&&r[a+l]==r[b+l];
}

void da(char str[], int sa[], int ra[], int height[], int n, int m)
{
    n++;
    int i, j, p, *x = t1, *y = t2;
    for(i = 0; i < m; i++) c[i] = 0;
    for(i = 0; i < n; i++) c[x[i]=str[i]]++;
    for(i = 1; i < m; i++) c[i] += c[i-1];
    for(i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
    for(j = 1; j <= n; j<<=1)
    {
        p = 0;
        for(i = n-j; i < n; i++) y[p++] = i;
        for(i = 0; i < n; i++) if(sa[i] >= j) y[p++] = sa[i]-j;
        for(i = 0; i < m; i++) c[i] = 0;
        for(i = 0; i < n; i++) c[x[y[i]]]++;
        for(i = 1; i < m; i++) c[i] += c[i-1];
        for(i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
        swap(x, y);
        p = 1; x[sa[0]] = 0;
        for(i = 1; i < n; i++)
            x[sa[i]] = cmp(y, sa[i-1], sa[i], j) ? p-1 : p++;
        if(p >= n) break;
        m = p;
    }
    int k = 0;
    n--;
    for(i = 0; i <= n; i++) ra[sa[i]] = i;
    for(i = 0; i < n; i++)
    {
        if(k) k--;
        j = sa[ra[i]-1];
        while(str[i+k]==str[j+k]) k++;
        height[ra[i]] = k;
    }
}

int lcp[maxn][32];

void initRMQ(int n)
{
    for(int i = 1; i <= n; i++) lcp[i][0] = height[i];
    for(int i = 1; (1<<i) <= n; i++)
        for(int j = 1; j+(1<<i)-1 <= n; j++)
            lcp[j][i] = min(lcp[j][i-1], lcp[j+(1<<i-1)][i-1]);
}

//传进去的坐标是从1-n
int LCP(int a, int b)
{
    a--, b--;
    int l = min(ra[a], ra[b])+1, r = max(ra[a], ra[b]);
    int len = r-l+1, i;
    for(i = 0; (1<<i) <= len; i++) ;
    i--;
    return min(lcp[l][i], lcp[r-(1<<i)+1][i]);
}

int dp[maxn];
const int mod = 1e9+7;

int main(void)
{
    int _, ca = 1;
    cin >> _;
    while(_--)
    {
        scanf(" %s %s", str1, str2);
        int len1 = strlen(str1);
        int len2 = strlen(str2);
        for(int i = 0; i < len1; i++)
            str[i] = str1[i];
        str[len1] = '#';
        for(int i = 0; i < len2; i++)
            str[i+len1+1] = str2[i];
        int len = len1+len2+1;
        str[len] = 0;
        da(str, sa, ra, height, len, 256);
        initRMQ(len);
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;
        for(int i = 1; i <= len1; i++)
        {
            dp[i] = dp[i-1];
            if(i-len2+1 >= 1 && (LCP(i-len2+1, len1+2) == len2))
                dp[i] = (dp[i]+dp[i-len2])%mod;
        }
        printf("Case #%d: %d\n", ca++, dp[len1]);
    }
    return 0;
}