杭电 1686 Oulipo (kmp)
2015-08-07 20:43
337 查看
Oulipo
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3 BAPC BAPC AZA AZAZAZA VERDI AVERDXIVYERDIAN
[align=left]Sample Output[/align]
1 3 0 [code][/code]
#include <stdio.h> #include <string.h> int next[10005]; char str1[1000005],str2[10005]; int cnt; void get_next(int len2)//生成next数组 { int i = 0,j = -1; next[i] = j; while (i<len2) { if(j == -1 || str2[i] == str2[j]) { i++; j++; next[i]=j; } else j = next[j]; } } int kmp(int len1,int len2)//kmp算法 { int i=0,j=0; get_next(len2); while(i<len1) { if(j==-1||str1[i]==str2[j]) { ++i; ++j; } else j=next[j]; if(j == len2) { cnt++; j = next[j]; } } } int main() { int n; int len1,len2; scanf("%d",&n); getchar(); while(n--) { gets(str2); gets(str1); len1 = strlen(str1); len2 = strlen(str2); cnt = 0; kmp(len1,len2); printf("%d\n",cnt); } return 0; }
相关文章推荐
- 四大组件之Activity小结
- 最锋利的VS Web开发工具扩展:Web Essentials详解
- js使用经验之谈
- 概念与原理
- HDOJ 1358 Period(KMP next数组运用)
- poj1113 Wall 凸包
- 将Visual Studio打造成为Node.js IDE
- 前端页面一些应用
- (转)概念与原理
- UITableView 表视图
- 11、C语言和设计模式(外观模式)
- Tarena - 运算符与表达式
- 关于List l1 = new LinkedList();报错:不兼容的类型的问题的解决
- 考研
- CodeForces 18C - Stripe 解题心得
- 关于XAMPP 无法启动mysql的解决方法
- 杭电 2047 阿牛的EOF牛肉串
- iOS开发_杂谈
- Subset sequence
- 关于线程的一点补充