POJ 3461 Oulipo KMP
来源:互联网 发布:php单例模式实例 编辑:程序博客网 时间:2024/06/05 11:57
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
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIANSample Output
1
3
0Source
BAPC 2006 Qualification
题目大意是这样的:
跟你多组数据, 每组数据中包含两个字符串W和T,询问W在T中出现了多少次。
显然要用KMP
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int SZ = 10010;const int LA = 1000010;int nxt[SZ];void getnxt(char n[]){ nxt[0] = nxt[1] = 0; int len = strlen(n); for(int i = 1; i < len; i ++) { int j = nxt[i]; while(j && n[i] != n[j]) j = nxt[j]; nxt[i + 1] = (n[i] == n[j] ? j + 1 : 0); }}int kmp(char n[], char m[]){ int ans = 0; int len1 = strlen(n), len2 = strlen(m); for(int i = 0, j = 0; i < len2; i ++) { while(j && n[j] != m[i]) j = nxt[j]; if(n[j] == m[i]) j ++; if(j == len1) ans ++; } return ans;}int main(){ int t; scanf("%d", &t); while(t --) { memset(nxt, 0, sizeof(nxt)); char n[SZ], m[LA]; scanf("%s", n); scanf("%s", m); getnxt(n); printf("%d\n", kmp(n, m)); }}
- 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
- 双栈排序
- svn的使用详细介绍
- Linux命令大全—all adb dif cmp 等
- Linux内核OOM机制分析
- 20秒 教你maven2的pom文件的依赖包如何写
- POJ 3461 Oulipo KMP
- 在win7系统中使用nodejs在WebStrom下配置socket.io
- 如何给root用户设置PATH环境变量
- Android子线程给主线程发送消息
- 小米闪屏页闪过一道白色页面的问题解决办法
- CSS <hr>标签在float布局中Firefox和Chrome的差异
- 鸟哥私房菜linux基础学习笔记 5
- Mybatis之XML配置文件解析
- Linux 命令大全