poj-3461 Oulipo KMP
来源:互联网 发布:cf刷枪源码 编辑:程序博客网 时间:2024/05/21 22:36
链接:戳这里
Oulipo
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 32550Accepted: 13161
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
AVERDXIVYERDIAN
Sample Output
1
3
0
题意:给出p,s串 问p串在s串中出现多少次
思路:裸地kmp
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<vector>#include <ctime>#include<queue>#include<set>#include<map>#include<stack>#include<cmath>#define mst(ss,b) memset((ss),(b),sizeof(ss))#define maxn 0x3f3f3f3f#define MAX 1000100///#pragma comment(linker, "/STACK:102400000,102400000")typedef long long ll;typedef unsigned long long ull;#define INF (1ll<<60)-1using namespace std;int T;string s,p;int n,m;int f[100100];void getf(){ int j=0; f[0]=f[1]=0; for(int i=1;i<m;i++){ j=f[i]; while(j && p[j]!=p[i]) j=f[j]; if(p[i]==p[j]) f[i+1]=j+1; else f[i+1]=0; }}int KMP(){ int num=0; int j=0; for(int i=0;i<n;i++){ while(j && p[j]!=s[i]) j=f[j]; if(s[i]==p[j]) j++; if(j==m) num++; } return num;}int main(){ scanf("%d",&T); while(T--){ cin>>p; cin>>s; n=s.size(); m=p.size(); getf(); printf("%d\n",KMP()); } return 0;}
0 0
- 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
- opencv2 伸展直方图以提高图像对比度
- python中list总结
- 15个数比较大小
- 接口与抽象类的区别
- 十大ios开发者喜爱的开源库
- poj-3461 Oulipo KMP
- 秒杀业务架构优化之路
- 快速判断素数,六素数法
- 闭包的基本概念
- LeetCode#106. Construct Binary Tree from Inorder and Postorder Traversal
- CCF 最优配餐
- leetcode——234——Palindrome Linked List
- JVM 堆内存设置原理
- iOS个人整理36-即时通信2 XMPP 好友列表 聊天信息