POJ--3461--Oulipo--并查集

Oulipo

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 18959		Accepted: 7611

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

BAPC 2006 Qualification

用KMP求字符串匹配个数，很有意思的一道题目。

思路注释里写的很清楚了。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxnum=1e5;

int next[maxnum];
int nextval[maxnum];
char s[(int)(1e6+100)];
char p[maxnum];

void get_next()
{
    next[0]=-1;
    int i=0; //主串下标
    int j=-1;//匹配串下标(其实是自身)
    int length=strlen(p);
    while(i<length)
    {
        if(j==-1||p[i]==p[j])
        {
            ++i;//将主串下标后移一位
            ++j;//将匹配串下标后移一位
            next[i]=j;//next[i]记录的是上一次两个字符相等时，下一次比较不成功应该比较的字符位置
            //包含next[len_p]哦！
        }
        else j=next[j];
    }
}

void get_nextval()//better一些，因为有一个判重的过程
{
    nextval[0]=-1;//nextval[i]记录的是上一次两个字符相等时，下一次比较不成功应该比较的字符位置,是包含的nextval[len_p]哦！
    int i=0;//主串下标
    int j=-1;//匹配串下标(其实是自身)
    int length=strlen(p);
    while(i<length)
    {
        if(j==-1||p[i]==p[j])
        {
            ++i;
            ++j;
            if(p[i]!=p[j]) nextval[i]=j;
            else nextval[i]=nextval[j];
        }
        else j=nextval[j];
    }
}

void kmp(int &ans)
{
    int i=0;//主串的移动下标
    int j=0;//匹配串的移动下标
    int len_s=strlen(s);//主串的长度
    int len_p=strlen(p);//匹配串的长度
    while(i<len_s&&j<len_p)
    {
        if(j==-1||s[i]==p[j])
        {
            ++i;
            ++j;
            if(j==len_p)
            {
                j=nextval[j]; 
                //非常神奇的地方！由于p[len_p-1]和s[i-1]比较的字符相同，而p[len_p](因为它为空)和s[i]比较的字符一定不同，因而要移到这个位置
                ++ans;
            }
        }
        else j=nextval[j];
    }
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int ans=0;
        scanf("%s",p);
        scanf("%s",s);
        get_nextval();
        kmp(ans);
        cout<<ans;
        printf("\n");
    }
    return 0;
}