字符串
文章平均质量分 58
lrbj
这个作者很懒,什么都没留下…
展开
-
Palindrome(poj3974)(manacher算法)
http://poj.org/problem?id=3974 Palindrome Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 2707 Accepted: 995 Description Andy the smart computer science student was attending an a原创 2013-08-11 21:33:11 · 1098 阅读 · 0 评论 -
KMP之求最大周期数
http://acmore.net:8080/contest/view.action?cid=11#problem/C C - KMP Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Given two strings a原创 2013-04-18 21:31:25 · 1137 阅读 · 0 评论 -
Blue Jeans(poj3080,后缀数组,求最长公共子串)
http://poj.org/problem?id=3080 http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=5414&pid=1012&ojid=1&hide=1&problem=Problem%20L Blue Jeans Time Limit : 2000/1000ms (Java/Other) Me原创 2013-08-14 20:45:53 · 973 阅读 · 0 评论 -
Phone List(poj3630,简单trie树)
/* http://poj.org/problem?id=3630 Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19441 Accepted: 6122 Description Given a list of phone numbers, determine if it is consi原创 2013-08-14 20:33:26 · 696 阅读 · 0 评论 -
Power Strings(poj2406 ,简单KMP)
http://poj.org/problem?id=2406 http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=5412&pid=1008&ojid=1 Power Strings Time Limit : 6000/3000ms (Java/Other) Memory Limit : 131072/65原创 2013-08-14 20:30:07 · 637 阅读 · 0 评论 -
Phone List(poj3630,字典树)
/*http://poj.org/problem?id=3630 Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18141 Accepted: 5773 Description Given a list of phone numbers, determine if it is consi原创 2013-04-19 21:07:39 · 776 阅读 · 0 评论 -
Maximum repetition substring(poj3693,后缀数组+RMQ)
http://poj.org/problem?id=3693 Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5542 Accepted: 1663 Description The repetition number of a string is defin原创 2013-08-14 20:48:33 · 2054 阅读 · 0 评论 -
Milk Patterns(poj 3261,后缀数组)
http://poj.org/problem?id=3261 Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8066 Accepted: 3673 Case Time Limit: 2000MS Descr原创 2013-08-14 20:42:19 · 650 阅读 · 0 评论 -
Shortest Prefixes(poj2001,tire树)
http://poj.org/problem?id=2001 Shortest Prefixes Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 11343 Accepted: 4816 Description A prefix of a string is a substring starting at the原创 2013-08-14 20:34:37 · 683 阅读 · 0 评论 -
KMP之模式匹配
http://acmore.net:8080/contest/view.action?cid=11#problem/D D - KMP Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description The French author Ge原创 2013-04-18 21:30:08 · 468 阅读 · 0 评论 -
Long Long Message(poj2274,后缀数组入门)
http://poj.org/problem?id=2774 Long Long Message Time Limit: 4000MS Memory Limit: 131072K Total Submissions: 17682 Accepted: 7196 Case Time Limit: 1000MS Description The little cat is majoring原创 2013-08-14 20:51:10 · 934 阅读 · 0 评论 -
Current Contest(poj3294,后缀数组)
http://poj.org/problem?id=3294 Current Contest Past Contests Scheduled Contests Award Contest 2011acy Log Out Mail:12(12) Login Log Archive Language: Life Forms Time Limit: 5000MS M原创 2013-08-14 20:37:09 · 670 阅读 · 0 评论 -
Oulipo (poj3461,简单KMP)
http://poj.org/problem?id=3461 http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=5412&pid=1004&ojid=1 Oulipo Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java原创 2013-08-14 20:31:47 · 611 阅读 · 0 评论 -
Quicksum(poj3094,水题)
/* http://poj.org/problem?id=3094 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28938#problem/A A - Quicksum Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u S原创 2013-08-14 20:20:53 · 679 阅读 · 0 评论 -
Quicksum(字符串基础)
http://poj.org/problem?id=3094 Quicksum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11831 Accepted: 8151 Description A checksum is an原创 2013-04-17 20:57:45 · 756 阅读 · 0 评论 -
Best Sequence(匹配+全排列(KMP+状态压缩))
http://poj.org/problem?id=3270 Best Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4065 Accepted: 1613 Description The t原创 2013-04-17 20:29:42 · 775 阅读 · 0 评论 -
Find the Shortest Common Superstring(hdu1841,KMP)
http://acm.hdu.edu.cn/showproblem.php?pid=1841 解析: 题意: 找到一个最短的串s,含有子串s1,s2 思路:两次KMP匹配 求出,s1后缀和s2前缀的最长公共串长度m1, s2后缀和s1前缀的最长公共串长度m2; ans=strlen(s1)+strlen(s2)-max(m1,m2); 6096 KB 359原创 2013-08-23 17:24:54 · 808 阅读 · 0 评论 -
B - Trie树(字符串问题)
/* http://acmore.net:8080/contest/view.action?cid=11#problem/B B - Trie树 Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description You, as a memb原创 2013-04-25 21:21:55 · 767 阅读 · 0 评论