HDU1686:Oulipo KMP算法

Oulipo

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

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
  
  

 

Source

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

 

Recommend

lcy

 

Statistic |  Submit |  Discuss |  Note
Link

KMP算法晦涩难懂，看了很多博客，了解了大致原理：

首先KMP算法是一个字符串匹配算法，对一个字符串，查找是否存在模式串，区别于传统匹配算法，KMP算法通过对模式串进行预处理，获得一个next数组，通过next数组的跳转实现快速匹配。

next数组原理：

next数组通过对模式串 “拆解” 获得，对于一个模式串，通过遍历模式串，查找是否存在相同子串

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000000+50;
int f [maxn];
int ls,la;
void getfill(char* s)
{
    memset(f,0,sizeof(f));
    for(int i=1;i<ls;i++)
    {
        int j=f[i];
        while(j && s[i]!=s[j])
            j=f[j];
        f[i+1]=(s[i]==s[j])?j+1:0;
    }
}
int find(char* a,char* s)
{
    int ans=0;
    getfill(s);int j=0;
    for(int i=0;i<la;i++)
    {
        while(j && a[i]!=s[j])
            j=f[j];
        if(a[i]==s[j])
            j++;
            //计数
        if(j==ls){
            ans++;
        }
    }
    return ans;
}
int main()
{
    char s[maxn];
    char a[maxn];
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s%s",s,a);
        ls=strlen(s);
        la=strlen(a);
        int ans=find(a,s);
        printf("%d\n",ans);
    }
    return 0;
}