POJ3461 KMP算法
来源:互联网 发布:程序员有必要考研吗 编辑:程序博客网 时间:2024/06/09 16:59
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
#include <iostream>#include <cstring>#include <string>using namespace std;#define mxt 1000008#define mxp 10008char T[mxt],P[mxp];int f[mxp];void getFail(){int len=strlen(P);f[0]=f[1]=0;for(int i=1;i<len;i++){int j=f[i];while(j&&P[i]!=P[j]){j=f[j];}f[i+1]=P[i]==P[j]?j+1:0;}}int KMP(){int n=strlen(T),m=strlen(P);getFail();int j=0;int sum=0;for(int i=0;i<n;i++){while(j&&T[i]!=P[j]){j=f[j];}if(T[i]==P[j]){j++;}if(j==m){sum++;}}return sum;}int main(){int t;cin>>t;while(t--){cin>>P>>T;cout<<KMP()<<endl;}return 0;}
- POJ3461 KMP算法
- KMP算法--poj3461
- KMP算法模板+POJ3461实现
- 再谈kmp算法 , 由poj3461
- HDU1686 POJ3461 Oulipo KMP算法
- POJ3461 Oulipo KMP算法应用
- kmp算法巩固 以poj3461为试验
- 【POJ3461】KMP算法理解 for 初学者
- poj3461 KMP算法(字符串匹配)
- poj3461(KMP)
- POJ3461 KMP
- KMP+poj3461
- poj3461 KMP
- poj3461 KMP
- poj3461 KMP
- POJ3461 KMP
- poj3461 KMP
- POJ3461——Oulipo KMP算法的应用
- PostgreSQL学习笔记4之常用数据类型
- Web.Config中节点的解释(推荐)
- 浅谈用jQuery实现无刷新验证码
- 设计模式在软件系统中的应用(一)之订阅模式
- 面试一
- POJ3461 KMP算法
- Android开发--AsyncTask异步任务(二)
- Windows进程间通信方式
- priority_queue
- 壬辰年末
- 关于零余额帐户
- 插入排序
- ubuntu系统为firefox安装flash plugin
- 2013-01-31 千里眼项目