HDU 2087 KMP

题意：给出字符串a , b 求b在a中出现了多少次，不可重叠。

思路：最裸的KMP。

#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#define Max 2505
#define FI first
#define SE second
#define ll long long
#define PI acos(-1.0)
#define inf 0x3fffffff
#define LL(x) ( x << 1 )
#define bug puts("here")
#define PII pair<int,int>
#define RR(x) ( x << 1 | 1 )
#define mp(a,b) make_pair(a,b)
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,s,t) for( int i = ( s ) ; i <= ( t ) ; ++ i )
using namespace std;

#define N 1111
char a[N] ;
char b[N] ;
int Next[N] ;
void get_Next(){
    Next[0] = -1 ;
    int k = -1 , j = 0 ;int l = strlen(b) ;
    while(k < l && j < l){
        if(k == -1 || b[k] == b[j]){
            k ++ ; j ++ ;
            Next[j] = k ;
        }else k = Next[k] ;
    }
}
int KMP(){
    int sum = 0 ;
    int posa = 0 , posb = 0 ;
    int la = strlen(a) ;int lb = strlen(b) ;
    while(posa < la &&posb < lb){
        if(posb == -1 || a[posa] == b[posb]){
            posa ++ ; posb ++ ;
            if(posb == lb){
                sum ++ ;
                posb = 0 ;
            }
        }else posb = Next[posb] ;
    }
    return sum ;
}
int main() {
    while(cin >> a , a[0] != '#'){
        cin >> b ;
        get_Next() ;
        printf("%d\n",KMP()) ;
    }
    return 0;
}