CodeForces - 808G（待做）

mark.
字符串kmp+dp。。
还是没明白他那个dp的过程。。
日后再看吧

char t[100005];
char s[100005];
int nxt[100005];
void kmp_pre(char x[], int m, int next[])
{
    int i, j;
    j = next[0] = -1;
    i = 0;
    while (i<m)
    {
        while (-1 != j && x[i] != x[j])j = next[j];
        next[++i] = ++j;
    }
}
int dp[100005], cnt[100005];
int main()
{
    scanf("%s", s);
    scanf("%s", t);
    kmp_pre(t, strlen(t), nxt);
    int len_s = strlen(s), len_t = strlen(t);
    if (len_t > len_s)printf("0\n");
    else
    {
        memset(cnt, 0, sizeof(cnt));
        memset(dp, 0, sizeof(dp));
        for (int i = len_t - 1; i < len_s; ++i) {
            bool flag = 1;
            for (int k = 0; k < len_t; ++k) {
                if (s[i - k] != t[len_t - 1 - k] && s[i - k] != '?') {
                    flag = 0; break;
                }
            }
            dp[i] = dp[i - 1];
            if (flag) {
                cnt[i] = dp[i - len_t];
                for (int k = nxt[len_t]; k != -1; k = nxt[k]) {
                    cnt[i] = max(cnt[i], cnt[i - (len_t - k)]);
                }
                cnt[i]++;
                dp[i] = max(dp[i], cnt[i]);
            }
        }
        printf("%d\n", dp[len_s - 1]);
    }
}

 #include<cstdio>
#include<cstring>
char s1[100007],s2[100007];
int fa[100007],f[100007],g[100007];
bool is[100007];
void maxs(int&a,int b){if(a<b)a=b;}
int main(){
    scanf("%s%s",s1+1,s2+1);
    int l1=strlen(s1+1),l2=strlen(s2+1);
    for(int i=2,j=0;i<=l2;++i){
        while(j&&s2[i]!=s2[j+1])j=fa[j];
        if(s2[i]==s2[j+1])++j;
        fa[i]=j;
    }
    for(int i=l2;i<=l1;++i){
        is[i]=1;
        for(int a=0;a<l2;++a)if(s1[i-a]!='?'&&s1[i-a]!=s2[l2-a]){
            is[i]=0;
            break;
        }
        g[i]=g[i-1];
        if(is[i]){
            f[i]=g[i-l2];
            for(int j=fa[l2];j;j=fa[j]){
                maxs(f[i],f[i-(l2-j)]);
            }
            ++f[i];
            maxs(g[i],f[i]);
        }
    }
    printf("%d",g[l1]);
    return 0;
}