关闭

POJ 3461&& hiho1015 Oulipo [KMP算法]

187人阅读 评论(0) 收藏 举报
分类:

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


题意:读入一个子串P,再读入一个主串S,问S串中有多少个P;

题解:典型的KMP算法裸题,直接套板子就OK(然而我并不会);

AC代码:

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define ll long long
#define N 100010
using namespace std ;
char s[N*10] , p[N] ;
int next[N*10] , lenp , lens;//*lenp是匹配,lens是主
void kkk()
{
    int i , j ;
    i = 0 ;
    j = next[0] = -1;
    while(i < lenp) //*主串里面找匹配
    {
        while(j!=-1&&s[i]!=s[j])
            j = next[j];
        next[++i] = ++j ;
    }
}

int KMP()
{
    int i , j , ans ;
    i = ans = j = 0 ;
    while(i!=lens&&j!=lenp)
    {
        if(s[i]==p[j]||j==-1)
            ++i , ++j;
        else j = next[j];
        if(j==lenp)
        {
            ans++;
            j = next[j] ;
        }
    }
    return ans ;
}
int main()
{
    int t ;
    cin>>t;
    while(t--)
    {
        memset(s,0,sizeof(s)) ;
        memset(p,0,sizeof(p)) ;
        memset(next , 0, sizeof(next));
        scanf("%s%s",p,s);
        lenp = strlen(p);//*匹配串
        lens = strlen(s);//*主串
        kkk();
        int ans = KMP();
        cout<<ans<<endl;
    }
    return 0 ;
}



0
0
查看评论

A - Oulipo(KMP算法经典)

#include #include #include int match (char w[],char s[],int next[])//统计w[]在s[]中出现的次数 {    int cnt=0;  //w[]在s[]中的频率初始化  int...
  • u014665013
  • u014665013
  • 2014-07-20 19:53
  • 897

KMP算法--[hiho1015]

KMP算法,用于实现字符串的匹配 朴素匹配方法的复杂度是O(N*M) KMP算法复杂度达到了O(N+M) 从这表达式来说,复杂度明显地降低了但这个算法最大的问题,就是很难理解。 在网上看了很多人,包括有个哥大家都说他讲得已经是最好的那个了,但是我还是没有看明白他在说什么,只是大概了解了他的思...
  • a19990412
  • a19990412
  • 2017-10-23 21:12
  • 300

POJ3461 字符串哈希

#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define...
  • u013654696
  • u013654696
  • 2014-02-13 16:50
  • 533

字符串hash - POJ 3461 Oulipo

Oulipo  Problem's Link ---------------------------------------------------------------------------- Mean:  给你一个模式串P...
  • u013371163
  • u013371163
  • 2017-03-05 17:13
  • 121

Poj 3461 Oulipo(KMP算法)

Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of t...
  • u011111528
  • u011111528
  • 2013-10-17 21:37
  • 492

poj 3461 Oulipo KMP算法

题目:给出一个单词w和一篇文章t,求该单词在文章中出现了多少次(可以有重叠部分)。 分析:很裸的KMP算法,现求出w的next数组,再进行匹配,匹配次数即为答案。 下面附程序: var w,t:ansistring; lenw,lent,i,n,j,l,ans:longint; n...
  • qq_33229466
  • qq_33229466
  • 2015-12-26 10:42
  • 161

kmp算法(POJ 3461 Oulipo)

kmp算法例题~
  • u013263923
  • u013263923
  • 2014-07-20 09:09
  • 637

poj 3461 Oulipo (KMP||hash)

Oulipo Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 35267   Accepted: 14255 Description The F...
  • yjf3151731373
  • yjf3151731373
  • 2016-08-02 15:20
  • 108

POJ 3461 Oulipo (KMP算法)

POJ 3461 Oulipo (KMP算法) 题目大意: T组测试数据,每组两行分别为word和text,问你text中包含多少个word子串。 解题思路: 较裸的一题KMP算法,关于KMP算法,参照:http://www.cppblog.com/oosky/archive/2006/07/...
  • a1061747415
  • a1061747415
  • 2014-06-03 18:36
  • 831

poj 3461 Oulipo KMP算法

escription The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of t...
  • u013087645
  • u013087645
  • 2014-02-15 13:30
  • 401
    个人资料
    • 访问:111556次
    • 积分:4327
    • 等级:
    • 排名:第8282名
    • 原创:332篇
    • 转载:3篇
    • 译文:1篇
    • 评论:11条
    最新评论