HDOJ 2087 剪花布条

题意：给出主串与模式串，找出主串中不重叠的模式串的个数

链接：http://acm.hdu.edu.cn/showproblem.php?pid=2087

思路：KMP，每找到一组匹配时，改变起点位置即可

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
13038007	2015-03-05 23:14:23	Accepted	2087	0MS	1192K	2294 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
//#include <unordered_map>
//#include <unordered_set>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define RDI(a) scanf ( "%d", &a )
#define RDII(a, b) scanf ( "%d%d", &a, &b )
#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )
#define RS(s) scanf ( "%s", s )
#define PIL(a) printf ( "%d\n", a )
#define PIIL(a,b) printf ( "%d %d\n", a, b )
#define PIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )
#define PSL(s) printf ( "%s\n", s )
#define REP(i,m,n) for ( int i = m; i <= n; i ++ )
#define DEP(i,m,n) for ( int i = m; i >= n; i -- )
#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )
#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
const double eps = 1e-10;
const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
struct node{
    int x, y, cnt;
    node(){}
    node( int _x, int _y ) : x(_x), y(_y) {}
    node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}
};
int pre[10000];
char x[1005];
char y[1005];
void preKMP ( int m )
{
    int i, j;
    j = pre[0] = -1;
    i = 0;
    while ( i < m ){
        while ( j != -1 && x[i] != x[j] ) j = pre[j];
        pre[++i] = ++j;
    }
}
int KMP ( int m, int n )
{
    int i, j;
    int ans = 0;
    preKMP ( m );
    i = j = 0;
    while ( i < n ){
        while ( j != -1 && x[j] != y[i] ) j = pre[j];
        i ++;
        j ++;
        if ( j >= m ){
            ans ++;
            j = i;
        }
    }
    return ans;
}
int main()
{
    while ( RS ( y ) ){
        if ( strcmp ( y, "#" ) == 0 )return 0;
        RS ( x );
        PIL ( KMP ( strlen( x ), strlen ( y ) ) );
    }
    return 0;
}