Oulipo - POJ 3461 KMP
来源:互联网 发布:阿里云账号 编辑:程序博客网 时间:2024/06/05 22:40
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
题意:在第二个字符串中找到第一个字符串出现的次数。
思路:KMP
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;char str1[1000010];char str2[10010];int f[10010];int n,m,ans;void find(){ int i,j=0; for(i=0;i<n;i++) { while(j && str2[j]!=str1[i]) j=f[j]; if(str2[j]==str1[i]) j++; if(j==m) ans++; }}void getfail(){ int i,j; memset(f,0,sizeof(f)); for(i=1;i<m;i++) { j=f[i]; while(j && str2[j]!=str2[i]) j=f[j]; if(str2[j]==str2[i]) f[i+1]=j+1; else f[i+1]=0; }}int main(){ int t,i,j,k; scanf("%d",&t); while(t--) { scanf("%s",str2); scanf("%s",str1); n=strlen(str1); m=strlen(str2); ans=0; getfail(); find(); printf("%d\n",ans); }}
- poj 3461 Oulipo(KMP)
- POJ 3461 Oulipo(KMP)
- POJ 3461 Oulipo---kmp
- POJ 3461 Oulipo KMP
- poj 3461 Oulipo (KMP)
- POJ 3461 Oulipo ( KMP )
- POJ 3461 Oulipo KMP
- POJ 3461 Oulipo / KMP
- Oulipo - POJ 3461 KMP
- 【KMP】 POJ 3461 Oulipo
- KMP---POJ 3461Oulipo
- POJ 3461 Oulipo (KMP)
- poj 3461 Oulipo kmp
- 【KMP】POJ-3461 Oulipo
- KMP POJ-3461 Oulipo
- poj-3461 Oulipo 【kmp】
- POJ 3461--Oulipo【KMP】
- poj 3461 Oulipo kmp
- 题目1163:素数(2008年北京航空航天大学计算机研究生机试真题)
- mysql常用数据类型
- Java内部类详解
- H264 NALU结构
- 用户在线登录时长统计
- Oulipo - POJ 3461 KMP
- mysql基本语句
- 程序员的一生
- Android开发 httpclient Post方法实现从tomcat服务器(JSP)获取listview信息
- mysql管理
- 使用poi解析Excel
- boost目录翻译序
- Android开发中4种Onclick事件的实现
- 使用DB2时发生该错误: SQLCODE=-668 不能向用EDITPROC定义的表中添加列