hdu 1686 Oulipo(KMP)
2014-07-22 10:42
232 查看
Oulipo
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4587 Accepted Submission(s): 1817
[align=left]Problem Description[/align]
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
KMP...
代码:
#include<stdio.h> #include<string.h> const int maxn=1000005; char a[maxn],b[10005]; int next[10005]; int m,n; void get_next() { int i=0,j=-1; next[0]=-1; while(i<m) { if(j==-1||b[i]==b[j]) { i++; j++; next[i]=j; } else j=next[j]; } } int kmp() { int i=0,j=0; int cnt=0; get_next(); while(i<n) { if(j==-1||a[i]==b[j]) { i++; j++; } else j=next[j]; if(j==m) { cnt++; j=next[j]; } } return cnt; } int main() { //freopen("in.txt","r",stdin); int t; scanf("%d",&t); while(t--) { scanf("%s %s",b,a); m=strlen(b); n=strlen(a); int ans=kmp(); printf("%d\n",ans); } return 0; }
相关文章推荐
- KMP——HDU 1686 Oulipo
- HDU 1686 Oulipo (kmp)
- hdu 1686(Oulipo) KMP基础题 / hdu 2087(剪花布条)KMP基本运用
- hdu1686 oulipo 【KMP】
- HDU - 1686 Oulipo(KMP)
- KMP——HDU 1686 Oulipo
- Hdu 1686 Oulipo[kmp]
- HDU 1686 Oulipo kmp入门
- hdu 1686 Oulipo (kmp)
- Oulipo - HDU 1686 (KMP模板题)
- HDU 1686 Oulipo(KMP)
- HDU 1686 Oulipo(kmp)
- hdu 1686 Oulipo(kmp)
- HDU 1686 Oulipo【KMP】
- HDU 1686 Oulipo——kmp
- hdu 1686 Oulipo (KMP模板)
- HDU 1686 Oulipo (KMP)
- HDU 1686 Oulipo (KMP——统计模式串出现次数)
- hdu 1686 Oulipo kmp
- Oulipo (poj 3461&&hdu 1686) KMP