HUD-1686-Oulipo HDU-kmp模板题

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. 

InputThe 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. 
OutputFor 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

题意：计算模式串在原串中出现的次数

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<string.h>
 4 using namespace std;
 5 
 6 const int N=1000020;
 7 const int M=10020;
 8 
 9 
10 char s[N];//原串
11 char t[M];//模式串
12 int nextt[M];
13 
14 void getnext(int len)//求的是模式串的next数组
15 {
16     int i=0,j=-1;
17     nextt[0]=-1;
18     while(i<len)
19     {
20         if(j<0||t[i]==t[j])
21             nextt[++i]=++j;
22         else
23             j=nextt[j];
24     }
25 }
26 
27 int kmp(int m,int n)//m模式串长度、n原串长度
28 {
29     int i=0,j=0,ans=0;
30     while(i<n)
31     {
32         if(j==-1||t[j]==s[i])
33         {
34             i++;
35             j++;
36         }
37         else
38             j=nextt[j];
39         if(j==m)
40         {
41             ans++;
42             j=nextt[j];
43         }
44 //        while(s[i]==t[j])
45 //        {
46 //            i++;
47 //            j++;
48 //        }
49 //        for(int i=0; s[i]=='\0'; i++)
50 //        {
51 //
52 //
53 //        }
54     }
55     return ans;
56 }
57 
58 int main()
59 {
60     int tt;
61     scanf("%d",&tt);
62     while(tt--)
63     {
64         memset(s,'\0',sizeof(s));
65         memset(t,'\0',sizeof(t));
66         memset(nextt,0,sizeof(nextt));
67         scanf("%s%s",t,s);//模式串、原串
68         int len1=strlen(t);//模式串
69         int len2=strlen(s);//原串
70         getnext(len1);
71         printf("%d\n",kmp(len1,len2));
72     }
73     return 0;
74 }

 

转载于:https://www.cnblogs.com/OFSHK/p/11390965.html