Match:Oulipo(POJ 3461)

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <functional>
 4 #include <string.h>
 5 
 6 using namespace std;
 7 
 8 typedef int Position;
 9 static char Text[1000002], Word[10002];
10 static int Next[10003];
11 
12 void KmpSearch(const int, const int);
13 void GetNext(const int);
14 
15 int main(void)
16 {
17     int case_sum;
18     scanf("%d", &case_sum);
19     getchar();
20 
21     while (case_sum--)
22     {
23         scanf("%s", Word);
24         scanf("%s", Text);
25         KmpSearch(strlen(Word), strlen(Text));
26     }
27     return EXIT_SUCCESS;
28 }
29 
30 void KmpSearch(const int w_len, const int t_len)
31 {
32     Position i = 0, j = 0;
33     int k_count = 0;
34     GetNext(w_len);
35 
36     while (i < t_len)
37     {
38         if (j == -1 || Text[i] == Word[j])
39         {
40             i++;
41             j++;
42             if (j == w_len)
43             {
44                 k_count++;
45                 j = Next[j];
46             }
47         }
48         else j = Next[j];
49     }
50     printf("%d\n", k_count);
51 }
52 
53 void GetNext(const int w_len)
54 {
55     Position i = 0, k = -1;
56     Next[0] = -1;
57 
58     while (i < w_len)
59     {
60         if (k == -1 || Word[i] == Word[k])
61         {
62             i++;
63             k++;
64             Next[i] = Word[i] != Word[k] ? k : Next[k];
65         }
66         else k = Next[k];
67     }
68 }