hdu1686 Oulipo--KMP

原题链接： http://acm.hdu.edu.cn/showproblem.php?pid=1686

一：原题内容

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
  
  

二：分析理解

给定一个文本字符串，再给定一个模式串，求这个模式串在这个文本串出现多少次。

三：AC代码

#include<iostream>
#include<string>

using namespace std;

char W[10010] = "#";
char T[1000010] = "#";
int nextval[10010];
  
void GetNextval()
{
	int w_len = strlen(W) - 1;
	int i = 1, j = 0;

	while (i <= w_len)//当循环做完，i的值是w_len+1,注意此处的nextval[i]也被赋值了，W[i]是等于'\0'的。
	{
		if (j == 0 || W[i] == W[j])
		{
			i++, j++;
			if (W[i] != W[j])
				nextval[i] = j;
			else
				nextval[i] = nextval[j];
		}
		else
			j = nextval[j];
	}
}

int KMP()
{
	GetNextval();
	int ans = 0;
	int t_len = strlen(T) - 1;
	int w_len = strlen(W) - 1;

	int i, j;
	i = j = 1;

	while (i <= t_len)
	{
		if (j == 0 || T[i] == W[j])
		{
			i++;
			j++;
		}
		else
			j = nextval[j];

		if (j > w_len)
		{
			j = nextval[j];//注意此处的W[j]=='\0'的，不明白请看GetNextval函数，这里的意思是在'\0'处失配该如何走，这一步用的很巧妙
			ans++;
		}
	}

	return ans;
}
int main()
{
	int N;
	cin >> N;
	while (N--)
	{
		cin >> W + 1 >> T + 1;
		cout << KMP() << endl;
	}
	return 0;
}