hdu1686--Oulipo
来源:互联网 发布:淘宝sma是雪梨的店吗 编辑:程序博客网 时间:2024/04/28 07:47
http://acm.hdu.edu.cn/showproblem.php?pid=1686
Problem 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.
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.
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
类似于hdu上剪花布条的那个题http://acm.hdu.edu.cn/showproblem.php?pid=2087,用到KMP算法
代码实现:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;char a[10005],b[1000005];int next[1000005];void getNext(char *a){ int i=0,j=-1; next[0]=-1; while(i<strlen(a)) { if(j==-1||a[i]==a[j]) i++,j++,next[i]=j; else j=next[j]; }}int main(){ int t; cin>>t; while(t--) { while(cin>>a) { cin>>b; getNext(a); int sum=0; int len1=strlen(a); int len2=strlen(b); if(len1>len2)cout<<endl; else { int i=0,j=0; while(i<len2) { if(j==-1||b[i]==a[j]) i++,j++; else j=next[j]; if(j==len1) { sum++; } } cout<<sum<<endl; } } } return 0;}
0 0
- hdu1686 Oulipo
- hdu1686 Oulipo
- Oulipo hdu1686
- HDU1686:Oulipo
- hdu1686 Oulipo
- hdu1686--Oulipo
- hdu1686 Oulipo
- hdu1686 Oulipo
- HDU1686-Oulipo
- HDU1686 Oulipo
- HDU1686 Oulipo
- HDU1686——Oulipo
- hdu1686 Oulipo(KMP)
- hdu1686 oulipo 【KMP】
- HDU1686 Oulipo(扩展KMP)
- hdu1686 Oulipo (KMP)
- hdu1686 Oulipo--KMP
- hdu1686 Oulipo kmp
- 干扰带
- 百度地图开发第四天(公交路线查询)
- 自定义View之贪吃蛇
- Cocos的回调函数
- umeng(友盟)集成--------认识umeng
- hdu1686--Oulipo
- MFC下CSocket编程详解
- spring整合hibernate配置文件
- 隐藏/显示界面动画效果
- with as 的用法(SQL)
- C++ 排序函数 sort(),qsort()的用法
- C#之 CS开发常用功能
- 1111:最高分是多少
- java 覆盖与重载