关于kmp几道比较基础的题（入门

kmp优化dp =.=
Anthem of Berland

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int n, m, ans ;
int nxt[N],g[N],f[N];
char a[N],b[N];
int pd(int x) {
    for (int i = 1; i <= m; ++i)
        if (a[x+i] != b[i] && a[x+i] != '?') return 0;
    return 1;
}
signed main() {
    cin>>a+1>>b+1;
    n= strlen(a+1),m= strlen(b+1);
    for (int i = 2, j = 0; i <= m; ++i) {
        while (j && b[i] != b[j + 1]) j = nxt[j];
        if (b[i] == b[j + 1]) j++;
        nxt[i] = j;
    }
    for(int i=m;i<=n;++i){
        if(!pd(i-m)){
            f[i]=f[i-1];
            continue;
        }
        g[i]=f[i-m]+1;
        int k=nxt[m];
        while (k){
            g[i]=max(g[i],g[i-m+k]+1);
            k=nxt[k];
        }
        f[i]=max(f[i-1],g[i]);
        ans=max(ans,f[i]);
    }
    cout<<ans;
}

分差kmp 0.0
MUH and Cube Walls

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5,inf=1e18;
int n,m,ans;
int aa[N],bb[N],a[N],b[N],nxt[N];
signed main() {
    cin>>n>>m;
    for(int i=1;i<=n;++i) cin>>aa[i];
    for(int i=1;i<=m;++i) cin>>bb[i];
    if(m==1){
        cout<<n;
        return 0;
    }
    for(int i=1;i<=n;++i) a[i]=aa[i+1]-aa[i];
    for(int i=1;i<=m;++i) b[i]=bb[i+1]-bb[i];
    n--,m--;
    for(int i=2,j=0;i<=m;++i){
        while (j&&b[i]!=b[j+1]) j=nxt[j];
        if(b[i]==b[j+1]) j++;
        nxt[i]=j;
    }
    for(int i=1,j=0;i<=n;++i){
        while (j&&a[i]!=b[j+1]) j=nxt[j];
        if(a[i]==b[j+1]) j++;
        if(j==m){
            ans++;
            j=nxt[j];
        }
    }
    cout<<ans;
}

进一步理解kmp ±+
Password

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
int nxt[N],vis[N];
char s[N];
signed main() {
    int n;
    cin>>s+1;
    n= strlen(s+1);
    for(int i=2,j=0;i<=n;++i){
        while (j&&s[i]!=s[j+1]) j=nxt[j];
        if(s[i]==s[j+1]) j++;
        nxt[i]=j;
    }
    int x=nxt[n],ans=0;
    while (x){
        vis[x]=1;
        x=nxt[x];
    }
    for(int i=2;i<n;++i) 
    	if(vis[nxt[i]]&&nxt[i]>ans) ans=nxt[i];
    if(ans) for(int i=1;i<=ans;++i) cout<<s[i];
    else cout<<"Just a legend";
}

递推（dp）/o/
Prefixes and Suffixes

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
int nxt[N],vis[N],num[N];
char s[N];
signed main() {
    int n;
    scanf(" %s",s+1);
    n= strlen(s+1);
    for(int i=2,j=0;i<=n;++i){
        while (j&&s[i]!=s[j+1]) j=nxt[j];
        if(s[i]==s[j+1]) j++;
        nxt[i]=j;
    }
    int x=nxt[n],ans=1;
    while (x){
        ans++;
        vis[x]=1;
        x=nxt[x];
    }
    cout<<ans<<endl;
    for(int i=n;i;--i)
        num[nxt[i]]+=++num[i];
    for(int i=1;i<n;++i)
        if(vis[i]) cout<<i<<" "<<num[i]<<endl;
        cout<<n<<" "<<1;
}