HDOJ1686 KMP简单题

Oulipo

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15581 Accepted Submission(s): 6140

Problem Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…

Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive ‘T’s is not unusual. And they never use spaces.

So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {‘A’, ‘B’, ‘C’, …, ‘Z’} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.

Input
The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

One line with the word W, a string over {‘A’, ‘B’, ‘C’, …, ‘Z’}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
One line with the text T, a string over {‘A’, ‘B’, ‘C’, …, ‘Z’}, with |W| ≤ |T| ≤ 1,000,000.

Output
For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.

Sample Input
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

Sample Output
1
3
0

Source
华东区大学生程序设计邀请赛_热身赛

Recommend
lcy | We have carefully selected several similar problems for you: 1358 3746 2203 3068 2222

我一开始的代码折腾了一个小时样例都没过，然后把代码删了重写一遍就AC了。。。
emmmmmm，人品很重要。。。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;

const int maxn = 1e6+5;
const int maxm = 1e4+5;
int i,j,k,m,n,current;
char w[maxm],text[maxn];
int nex[maxm];

void make_nex(){
    nex[0] = nex[1] = 0;
    for(i=1; i<m; i++)
    {
        k = nex[i];
        while(k && w[i]!=w[k]) k = nex[k];
        nex[i+1] = w[i]==w[k]?k+1:0;
    }
}

int kmp(){
   int ans = 0;
   k =0;
   for (i=0; i<n; i++) {
      while(k && text[i]!=w[k]) k = nex[k];
      if (text[i] == w[k]) k++;
      if (k>=m) {ans++; k=nex[k];}
   }
   return ans;
}

int main(){
    int T;
    scanf("%d",&T);
    while (T--) {
        scanf("%s",w); m = strlen(w);
        scanf("%s",text); n = strlen(text);
        make_nex();
        printf("%d\n",kmp());
    }
    return 0;
}