KMP 复习 再续~~
来源:互联网 发布:程序员大神 编辑:程序博客网 时间:2024/06/16 23:49
http://vjudge.net/contest/view.action?cid=47286#problem/B
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 <stdio.h>#include <string.h>#include <algorithm>#include <iostream>using namespace std;const int N=1000002;int next[N/100+2];int m,n;char a[N],b[N];void get_next(){ int i,j; next[0]=j=-1; for(i=1;i<m;i++) { while(j>-1&&b[i]!=b[j+1]) j=next[j]; if(b[i]==b[j+1]) j++; next[i]=j; }}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%s%s",b,a); n=strlen(a); m=strlen(b); get_next(); int j=-1,ip=0; for(int i=0;i<n;i++) { while(j>-1&&a[i]!=b[j+1]) j=next[j]; if(a[i]==b[j+1]) j++; if(j==m-1) { ip++; j=next[j]; } } printf("%d\n",ip); } return 0;}
- KMP 复习 再续~~
- kmp复习
- KMP复习整理
- KMP算法复习
- KMP复习小结
- 扩展KMP复习小记
- KMP复习 找字符串
- KMP算法复习
- 【各种算法】【kmp】复习
- [复习]KMP 字符串匹配
- KMP匹配算法复习。。
- [复习]KMP 删除子串
- KMP算法复习【+继续学习】
- Binary String Matching---KMP算法,再次复习
- KMP算法复习总结:Bzoj3620&&Bzoj3670
- [leetcode]Repeated Substring Pattern顺带复习KMP
- [数据结构]KMP算法(个人复习用)
- 一步一步复习数据结构和算法基础-KMP算法
- Android中常见的两种“无法卸载”的情况
- LevelDB 之 arena
- CentOS初始化(同步时间,cp忽略,中文乱码)
- 算法的五个特征
- View.bringToFront
- KMP 复习 再续~~
- MySQL学习笔记之九 字符串模式匹配
- 理解inode
- SVN服务器搭建和使用(二)
- 文档附件在线查看(类似百度文库的实现)
- 全面分析 Spring 的编程式事务管理及声明式事务管理
- UC笔试题(一)
- python中PIL库在使用时出现The _imagingft C module is not installed错误
- 未能加载文件或程序集“Enyim.Caching”或它的某一个依赖项。未能验证强名称签名。此程序集可能已被篡改,或者已被延迟签名,但没有用正确的私钥进行完全签名。 (异常来自 HRESULT:0x80