hdu1686--Oulipo
发布日期:2022-02-02 02:58:13 浏览次数:4 分类:技术文章

本文共 2833 字,大约阅读时间需要 9 分钟。


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
3BAPCBAPCAZAAZAZAZAVERDIAVERDXIVYERDIAN
 

Sample Output
130


类似于hdu上剪花布条的那个题,用到KMP算法

代码实现:

#include 
   
    #include 
    
     #include 
     
      using namespace std;char a[10005],b[1000005];int next[1000005];void getNext(char *a){
      
int i=0,j=-1;
next[0]=-1;
while(i
{
if(j==-1||a[i]==a[j])
i++,j++,next[i]=j;
else
j=next[j];
}}int main(){
int t;
cin>>t;
while(t--)
{
while(cin>>a)
{
cin>>b;
getNext(a);
int sum=0;
int len1=strlen(a);
int len2=strlen(b);
if(len1>len2)cout<
else
{
int i=0,j=0;
while(i
{
if(j==-1||b[i]==a[j])
i++,j++;
else
j=next[j];
if(j==len1)
{
sum++;
}
}
cout< <
}
}
}
return 0;}


转载地址:https://blog.csdn.net/u010368749/article/details/20903371 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:hdu1683--Colour sequence
下一篇:poj3356---AGTC

发表评论

最新留言

很好
[***.249.68.14]2022年05月22日 14时37分10秒