【POJ3461】Oulipo
来源:互联网 发布:电脑测评软件 编辑:程序博客网 时间:2024/05/17 04:58
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
Source
[Submit] [Go Back] [Status] [Discuss]
这个是子串匹配,和模板的模式串匹配有一点不同,就那一点next数组值的存储范围包括第lens个,因为你判断玩一个子串后要判断是不是前面有已经重合的部分,就像第二个输入输出样例。#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;const int N = 1e6+20;const int M = 1e5+10;char p[N],s[M];int next[M];int lens,lenp;void getNext() {int j,k;next[0]=-1;j=0,k=-1;while(j!=lens) {if(k==-1||s[k]==s[j]) {k++;j++;next[j]=k;} elsek=next[k];}}int KMPMatch() {int i=0,j=0,count=0;while(i<lenp) {if(j==-1||p[i]==s[j]) {i++;j++;} elsej=next[j];if(j==lens) {count++;j=next[j];}}return count;}int main() {int T;scanf("%d",&T);while(T--) {scanf("%s%s",s,p);lens=strlen(s);//加了这两句就能ac,不加直接strlen(s)就超时,我也是醉了 lenp=strlen(p);//不造为啥,以后要规范细节啊,否则容易吃大亏,//尽量避免意向不到的错误而导致改都不知道怎么改 getNext();int ans=KMPMatch();printf("%d\n",ans);}return 0;}题目地址:http://poj.org/problem?id=3461
- POJ3461:Oulipo
- POJ3461 Oulipo
- poj3461 Oulipo
- poj3461-Oulipo
- poj3461 Oulipo
- POJ3461 Oulipo
- POJ3461 Oulipo
- poj3461 Oulipo
- 【POJ3461】Oulipo
- poj3461 Oulipo
- 【POJ3461】Oulipo
- 【KMP】 poj3461 Oulipo
- 【KMP】Oulipo POJ3461
- poj3461 Oulipo (kmp)
- [POJ3461] Oulipo[KMP基础]
- poj3461 Oulipo,Kmp
- POJ3461 Oulipo 【KMP】
- POJ3461 Oulipo KMP
- Apache官网下载.jar包
- 安卓模拟器使用sqlite3查看APP的数据库
- UVA-455
- 2016/8/16【个人网站】第十六天
- 百度和极光的推送
- 【POJ3461】Oulipo
- 多种排列方式满足条件,输出按照名字排列字典序最小的一个
- git提交代码前用php-cs-fixer强制格式化代码
- 虚拟机安装Linux系统
- 产品经理应该有这样的产品思维
- 机器学习 之 Haar特征
- RNN神经网络
- 登录加入验证码功能
- ubuntu-16.04-desktop-amd64的艰辛安装之路