pku3461 Oulipo (KMP)
来源:互联网 发布:淘宝我的回答能删除么 编辑:程序博客网 时间:2024/06/06 13:23
http://poj.org/problem?id=3461
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
直接s[]+t[],在求next[]过程中得解
#include<stdio.h>#include<iostream>#include<string.h>using namespace std;int next[1100000];char s[1020000],t[1000009];int ans,len;void getnext(){ int i=0,j=-1; int lens=strlen(s); next[0]=-1; while(i<lens) { if(j==-1||s[i]==s[j]) { next[++i]=++j; if(next[i]==len)ans++; } else j=next[j]; }}int main(){ int T; scanf("%d",&T); while(T--) { ans=0; scanf("%s%s",s,t); len=strlen(s); s[len]=1; s[len+1]=0; strcat(s,t); getnext(); printf("%d\n",ans); } return 0;}
- pku3461 Oulipo (KMP)
- PKU3461(Oulipo)字符串匹配-KMP算法
- KMP:Oulipo
- Oulipo +KMP
- Oulipo KMP
- KMP Oulipo
- Oulipo KMP
- 3461 Oulipo //KMP
- HDU 1686 Oulipo (kmp)
- poj Oulipo(KMP)
- poj 3461 Oulipo(KMP)
- (简单kmp) Oulipo (p3461)
- 【KMP】 poj3461 Oulipo
- 【KMP】Oulipo POJ3461
- hdu 1686 kmp Oulipo
- poj3461 Oulipo (kmp)
- POJ 3461 Oulipo(KMP)
- KMP hdu-1686-Oulipo
- UVa 10303 How Many Trees? (卡特兰数&高精度)
- Round #203 (Div. 2)B------Resort
- 分享一例iptables 防火墙配置
- Linux的五个查找命令
- 第二章--选择器
- pku3461 Oulipo (KMP)
- C++内存分配方式详解——堆、栈、自由存储区、全局/静态存储区和常量存储区
- 第三章--可视化格式模型
- md5算法的C程序
- 第四章--背景图像效果
- 第五章--对连接应用样式
- oracle view视图update
- HttpClient_4 用法 由HttpClient_3 升级到 HttpClient_4 必看
- 第六章--列表导航条