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
题解:查找主串中字串的个数,利用KMP模板,so easy。
代码如下:
#include <iostream>
#include <string>
#include <cstdio>
#include <string.h>
using namespace std;
int a[1000005],b[100005],c[100005];
int n,m;
void getnext()
{
int i=1,j=0;
c[1]=0;
while(i<m)
{
if(j==0||b[i]==b[j])
{
i++;
j++;
if(b[i]!=b[j])
c[i]=j;
else
c[i]=c[j];
}
else
j=c[j];
}
}
int kmp()
{
int i=1,j=1;
while(i<=n&&j<=m)
{
if(j==0||a[i]==b[j])
{
i++;
j++;
}
else
j=c[j];
}
if(j>m)
return i-m;
return -1;
}
int main()
{
int k;
cin>>k;
while(k--)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
cin>>n>>m;
for(int i=1; i<=n; ++i)
cin>>a[i];
for(int i=1; i<=m; ++i)
cin>>b[i];
getnext();
cout<<kmp()<<endl;
}
return 0;
}