hdu

最新推荐文章于 2019-03-19 22:05:25 发布

xiaoleiacm

最新推荐文章于 2019-03-19 22:05:25 发布

阅读量883

点赞数

分类专栏： kmp 数据结构

本文链接：https://blog.csdn.net/xiaoleiacmer/article/details/9567051

版权

kmp 数据结构专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Oulipo

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3459 Accepted Submission(s): 1351

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

Source

华东区大学生程序设计邀请赛_热身赛

Recommend

lcy

code:

#include<iostream>
#include<cstring>
#include<string.h> 
#include<stdlib.h>
#include<stdio.h>
using namespace std;
char s[1000005],t[10005];
int next[10005];
void get_next(char *t)
{
	int i=0,j=-1;
	next[0]=-1;
	int Lt=strlen(t);
	while(i<Lt)
	{
		if(j==-1||t[i]==t[j])
		{
			if(t[++i] != t[++j])
			next[i]=j;  
            else next[i]=next[j];			
		}
		else
		j=next[j];
	}
}
int kmp()
{
	int i=0,j=0;
	int lens=strlen(s);
	int lent=strlen(t);
	int sum=0;	
	get_next(t);
	while(i<=lens&&j<=lent)
	{
		if(j==-1||s[i]==t[j])
		{
			++i,++j;
				
		}
		else
		j=next[j];
		if(j==lent)
		{
			sum++;
			j=next[j];
		}	
	}
	return sum;
}
int main()
{
	int cas;
	scanf("%d",&cas);
	while(cas--)
	{
	//	memset(s,0,sizeof(s));
	//	memset(t,0,sizeof(t));
		scanf("%s%s",t,s);
		
		printf("%d\n",kmp());
		
	}
	return 0;
}