字符串
关注
分享
扫一扫
文章平均质量分 83
HuanTongH
这个作者很懒，什么都没留下…
展开
-
poj 1997 trie树
Word PuzzleTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 1113 Accepted: 494DescriptionWhat a game collection it would be without famous and well kno原创 2015-04-14 18:01:20 · 598 阅读 · 0 评论 -
hdu 2222 ac自动机模板题
Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40636 Accepted Submission(s): 12942Problem DescriptionIn the moder原创 2015-04-24 15:42:49 · 472 阅读 · 0 评论 -
hdu 3973 字符串hash+线段树动态维护
AC's StringTime Limit: 30000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1091 Accepted Submission(s): 311Problem DescriptionYou are given原创 2015-04-15 23:57:27 · 686 阅读 · 0 评论 -
poj 2778 AC自动机+dp矩阵快速幂
DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12628 Accepted: 4818DescriptionIt's well known that DNA Sequence is a sequence only contains原创 2015-04-24 20:59:39 · 449 阅读 · 0 评论 -
poj 1816 Trie+DFS匹配模式串
Wild WordsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4887 Accepted: 1274DescriptionA word is a string of lowercases. A word pattern is a string of原创 2015-04-26 12:06:21 · 522 阅读 · 0 评论 -
poj 2774 后缀数组模板
求两个字符串的最长公共子串。将两个字符串连接为一个新字符串，并计算后缀数组和高度数组lcp。然后检查后缀数组中所有相邻的后缀，其中后缀分别属于第一和第二个字符串的lcp的最大值就是答案。#include #include #include #include #include #include #include #include #include #includ原创 2015-04-21 23:52:14 · 485 阅读 · 0 评论 -
poj 3415 后缀数组+单调队列
Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8106 Accepted: 2688DescriptionA substring of a string T is defined as:T(i, k)=TiT原创 2015-05-18 17:47:46 · 638 阅读 · 0 评论