KMP算法——POJ 3461

对应POJ题目：点击打开链接

 

OulipoCrawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

 

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模板题

 

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<iostream>
using namespace std;
const int MAXN=100050+10;
const int INF=1<<25;
char M[10009];
char T[1000009];
int next[10009];
int sum;

void GetNextval()
{
	int j=0,k=-1;
	next[0]=-1;
	while(j<strlen(M))
	{
		if(k==-1 || M[j]==M[k]){
			j++; k++;
			if(M[j]!=M[k]) next[j]=k;
			else next[j]=next[k];
		}
		else k=next[k];
	}
}

/*void GetNextval()//这样也可以
{
	int j=0,k=-1;
	next[0]=-1;
	while(j<strlen(M))
	{
		if(k==-1 || M[j]==M[k]){
			j++; k++;
			next[j]=k;
		}
		else k=next[k];
	}
}*/

void KMPIndexl()
{
	int i=0,j=0;
	int len=strlen(M);
	int leni=strlen(T);
	while(i<leni)
	{
		if(j==-1 || T[i]==M[j]){
			i++; j++;
			if(j==len) {sum++;}
		}
		else j=next[j];
	}
}

int main()
{
	//freopen("in.txt","r",stdin);
	int w;
	scanf("%d",&w);
	while(w--)
	{
		memset(next, 0,sizeof(next));
		scanf("%s%s",M,T);
		GetNextval();
		for(int i=0; i<5; i++) cout<<next[i]<<" ";
		cout<<endl;
		sum=0;
		KMPIndexl();
		printf("%d\n",sum);
	}
	return 0;
}