----------KMP
mfcheer
他不停地跑啊跑 就为了追上那个曾经被寄予厚望的自己
展开
-
poj-3461 Oulipo 【kmp】
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26367 Accepted: 10522DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La原创 2015-03-06 20:36:24 · 403 阅读 · 0 评论 -
poj 2752 Seek the Name, Seek the Fame 【kmp】
题目链接:http://poj.org/problem?id=2752题意:求即是前缀有是后缀的子串有几个,输出长度。思路:考察next数组的性质。具体见代码。#include <stdio.h> #include <iostream> #include <math.h> #include <stdlib.h> #include <ctype.h> #include <algor原创 2015-06-05 18:15:11 · 393 阅读 · 0 评论 -
LIGHTOJ 1255-SUBSTRING FREQUENCY 【KMP】
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1255题意:求母串中包含子串的个数,可重叠。代码:#include <stdio.h> #include <iostream> #include <math.h> #include <stdlib.h> #include <ctype.h> #include <原创 2015-06-05 23:24:18 · 518 阅读 · 0 评论 -
hdu 3336 Count the string 【kmp + dp】
题目链接:http://acm.acmcoder.com/showproblem.php?pid=3336题意:求给出的字符串的所有前缀出现的次数和。dp的思想还是看的别人的题解。窝就不写啦。代码:#include <stdio.h>#include <iostream>#include <string.h>#include <algorithm>#include <math.h>#inc原创 2015-06-05 18:12:20 · 426 阅读 · 0 评论 -
hdu 2594 Simpsons’ Hidden Talents 【KMP】
题目链接:http://acm.acmcoder.com/showproblem.php?pid=2594题意:求最长的串 同时是s1的前缀又是s2的后缀。输出子串和长度。思路:kmp代码:#include <vector>#include <string>#include <algorithm>#include <iostream>#include <stdio.h>#include原创 2015-06-05 17:08:45 · 95 阅读 · 0 评论 -
字符串匹配 【kmp】
字符串匹配 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 214 Solved: 81 Description 给你两个字符串A,B,请输出B字符串在A字符串中出现了几次。Input 多组测试数据,每组输入两个字符串。字符串的长度 <= 1000000.Output 输出B在A中出现的次数。Sample Input aaa aa原创 2015-03-30 21:48:27 · 637 阅读 · 0 评论 -
The Minimum Length 【kmp】
The Minimum LengthTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is a string A. The length of A is less than 1,000,000. I re原创 2015-03-07 14:31:56 · 516 阅读 · 0 评论 -
hdu-2087 剪花布条 【kmp】
剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10026 Accepted Submission(s): 6482Problem Description一块花布条,里面有些图案,另有一块直接可原创 2015-03-06 21:21:23 · 473 阅读 · 0 评论 -
hdu-1711
kmp 模板题 #include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int a[1000005],b[10005];int nex原创 2014-11-18 22:39:37 · 505 阅读 · 0 评论 -
hdu-1358 Period 【kmp】
PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3443 Accepted Submission(s): 1727Problem DescriptionFor each prefix of原创 2015-03-07 12:26:38 · 582 阅读 · 0 评论 -
poj-2406 Power Strings 【kmp】
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 34716 Accepted: 14367DescriptionGiven two strings a and b we define a*b to be their conca原创 2015-03-07 14:52:59 · 685 阅读 · 0 评论 -
hdu-3746 Cyclic Nacklace 【kmp】
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3253 Accepted Submission(s): 1488Problem DescriptionCC always原创 2015-03-07 10:13:25 · 630 阅读 · 0 评论 -
LIGHTOJ 1258 – MAKING HUGE PALINDROMES 【KMP】
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1258题意:为了使原串变为回文串,可任意添加字符,求变为回文串之后字符的长度。解法:求字符串与其反串的最大公共长度len,则最后回文字符串的长度为:原串长度*2-len;代码:#include <stdio.h> #include <iostream> #include <原创 2015-06-05 23:22:20 · 500 阅读 · 0 评论