KMP训练~Oulipo~解题报告

Oulipo

题目描述：

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.

题目大意：

给出测试样例数目，每个样例分别给出了模式串和文本串，问模式串在文本串有多少个匹配，并且记录匹配数目。

思路分析：

 1. 这里首先依然是用KMP算法去写，但是这里有一个必须要注意
 这里需要记录匹配的数目，而不是记录匹配开始的位置，所以需
 要记录，并且当匹配完一个后，模式串的位置发生改变。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<cstring>
#include<cmath>
#include<set>
using namespace std;
const int maxn=1000000;
const int maxm=10000;
int Next[maxn];
void LemonGetNext(string s1)
{
	Next[0]=-1;
	int k=-1;
	int l=0;
	int num=s1.length();
	while(l<num)
	{
		if(k==-1 || s1[k]==s1[l])
		{
			l++;
			k++;
			if(s1[k]!=s1[l])
			{
				Next[l]=k;
			}
			else
			{
				Next[l]=Next[k];
			}
		}
		else
		{
			k=Next[k];
		}
	}
}
int LemonSource(string s1,string s2)
{
	int l=0;
	int k=0;
	int num1=s1.length();
	int num2=s2.length();
	int sum=0;
	while(k<num2)
	{
		if(l==-1 || s1[l]==s2[k])
		{
			l++;
			k++;
		}
		else
		{
			l=Next[l];
		}
		if(l==num1)//当匹配完 
		{
			sum++;
			l=Next[l];//这里需要变为上次Next数组，这里我误认为是0导致TL，难受 
		}
	}
	return sum;
}
int main()
{
	string s1,s2;
	int num;
	cin >> num;
	while(num--)
	{
		int b;
		cin >> s1 >> s2;//得到模式串与模式串 
		LemonGetNext(s1);//得到Next数组 
		b=LemonSource(s1,s2);//得到匹配数目 
		cout << b << endl;
	}
}