SDJZU_新生_KMP/字符串



E - Oulipo

Crawling 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

依次寻找相同的字符串。

代码：

#include<stdio.h>
#include<string.h>

char a[1000000];
int next[1000000];
void getnext(char *b,int m)
{
    for(int i = 1; i < m; i ++)
    {
        next[0] = next[1] = 0;
        int j = next[i];
        while(j && b[i] != b[j])
            j = next[j];
        next[i + 1] = b[i] == b[j] ?j + 1 : 0;
    }
}
int kmp(char *a,char *b)
{
    int m = strlen(b);
    int n = strlen(a);
    int j = 0;
    int s = 0;
    for(int i = 0; i < n; i ++)
    {
        while(j && a[i] !=b[j])
            j = next[j];
        if(a[i] == b[j])
            j ++;
        if(j == m)
        {
            s = s + 1;
            j = next[j];//不明白意思？为什么不可以是 i= i- j+ 1;j = 0;
        }
    }
    return s;
}
int main()
{
    char b[1000000];
    int t;
    scanf("%d",&t);
    while(t --)
    {
        int k;
        scanf("%s",b);
        getchar();
        scanf("%s",a);
        int m = strlen(b);
        getnext(b,m);
        k = kmp(a,b);
        printf("%d\n",k);
    }
    return 0;
}

题目理解了，但是其中的一步骤还是不大理解，用i= i- j；j = 0;不知道为什么不行，那一步骤是看的同学的，不过还是不理解什么意思。