KMP模板 和入门题

HDU1711 

题意就是给你两个序列，让你求B序列在A序列第一次出现（完全相同）的下标 
本题就是KMP的模板题，将i指针指向A串，将j指针指向B串，如果匹配就继续下一位的匹配，如果不匹配，将j跳转到next[j]，继续向前匹配。

#include<bits/stdc++.h>
#define INF 0x3fffffff
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(false)
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
int t, n, m, net[1000010], s1[1000010], s2[1000010];

void getn() {
    net[0] = -1;
    int i = 0, j = -1;
    while(i < m) {
        if(j == -1 || s2[i] == s2[j]) {
            i++, j++;
            net[i] = j;
        } else {
            j = net[j];
        }
    }
}

int kmp() {
    int i = 0, j = 0;
    while(i < n && j < m) {
        if(j == -1 || s1[i] == s2[j])
            i++, j++;
        else
            j = net[j];
    }
    if(j == m)
        return i - j + 1;//我开的数组从0开始所以加一
    else
        return -1;
}

int main() {IOS;
    cin >> t;
    while(t--) {
        cin >> n >> m;
        me(net);
        for(int i = 0; i < n; i++)
            cin >> s1[i];
        for(int i = 0; i < m; i++)
            cin >> s2[i];
        getn();
        cout << kmp() << endl;
    }
    return 0;
}

HDU1686 

题意就是求B串在A串中的出现次数（可重叠 ）

#include<bits/stdc++.h>
#define INF 0x3fffffff
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(false)
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
int t, net[1000010];
string s1, s2;

void getn() {
    net[0] = -1;
    int i = 0, j = -1;
    while(i < s2.length()) {
        if(j == -1 || s2[i] == s2[j]) {
            i++, j++;
            net[i] = j;
        } else {
            j = net[j];
        }
    }
}

int kmp() {
    int i = 0, j = 0, ans = 0;
    while(i < s1.length()) {
        if(j == -1 || s1[i] == s2[j])
            i++, j++;
        else
            j = net[j];
        if(j == s2.length())
            ans++, j = net[j];
    }
    return ans;
}

int main() {
    cin >> t;
    while(t--) {
        cin >> s2 >> s1;
        getn();
        cout << kmp() << endl;
    }
    return 0;
}

HDU2087 
题意就是求B串在A串中的出现次数（不可重叠) 

#include<bits/stdc++.h>
#define INF 0x3fffffff
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(false)
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
string s1, s2;
int net[1000010];
void getnext() {
    int i = 0, j = -1;
    net[0] = -1;
    while(i < s2.length()) {
        if(j == -1 || s2[i] == s2[j])
            i++, j++;
        else
            j = net[j];
    }
}
int kmp() {
    int i = 0, j = 0, ans = 0;
    while(i < s1.length()) {
        if(j == -1 || s1[i] == s2[j])
            i++, j++;
        else
            j = net[j];
        if(j == s2.length())
            j = 0, ans++;
    }
    return ans;
}
int main() {
    while(cin >> s1 && s1 != "#") {
        cin >> s2;
        getnext();
        cout << kmp() << endl;
    }
    return 0;
}

HDU3746 

kmp求最小循环节，这道题如果理解了next数组应该可以解出来，n-next[n]就是常为n的数组最小循环节

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(false)
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
const int maxn = 1e6 + 5;
int Next[maxn];
char str[maxn];
char mo[maxn];
int n1, n2;
void GetNext() {
    int i = 0, j = -1;
    while(i < n2) {
        if(j == -1 || mo[i] == mo[j])
            Next[++i] = ++j;
        else
            j = Next[j];
    }
    return ;
}
int main() {
    int t;
    scanf("%d", &t);
    while(t--) {
        scanf("%s", mo);
        n2 = strlen(mo);
        Next[0] = -1;
        GetNext();
        int tmp = n2 - Next[n2];
        if(n2 % tmp == 0 && n2 != tmp) {
            printf("0\n");
        } else {
            printf("%d\n", tmp - n2 % tmp);
        }
    }
    return 0;
}