![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
字符串处理
文章平均质量分 91
Clearle
我就是要证明给你看!
展开
-
UVA 10361 Automatic Poetry
Problem I Automatic Poetry Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB “Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”原创 2013-07-29 13:23:13 · 522 阅读 · 0 评论 -
UVA 537 Artificial Intelligence?
Artificial Intelligence? Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and underst原创 2013-07-29 13:26:04 · 570 阅读 · 0 评论 -
UVA 401 Palindromes
Palindromes A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when t原创 2013-07-29 13:14:44 · 494 阅读 · 0 评论 -
UVA 10010 Where's Waldorf?
Where's Waldorf? Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line o原创 2013-07-29 13:19:27 · 496 阅读 · 0 评论 -
poj 3461 Oulipo kmp基础
Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18167 Accepted: 7292 Description The French author Georges Perec (1936–1982) once wrote a book, La d原创 2013-10-01 11:20:33 · 559 阅读 · 0 评论 -
后缀数组模板
转自 学长 template struct suffixarray { int str[LEN*3],sa[LEN*3]; int rank[LEN],height[LEN]; int id[LEN]; int best[LEN][20]; int len; bool equal(int *str, int a, int b) {转载 2014-06-04 20:18:31 · 477 阅读 · 0 评论 -
UVA 11107 Life Forms 后缀数组
白书上的例题,贴的模板。。。原创 2014-06-05 16:39:13 · 726 阅读 · 0 评论 -
HDU 2594 Simpsons’ Hidden Talents kmp next数组问题
Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2704 Accepted Submission(s): 1024 Problem Description H原创 2014-06-06 10:57:13 · 475 阅读 · 0 评论 -
FZU 2137 奇异字符串 字符串哈希
Problem 2137 奇异字符串 Accept: 60 Submit: 240 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description seen喜欢一种特殊的字符串,seen称这种字符串为奇异字符串。奇异字符串可以表示为AxA这种形式,A为一个任意非空字符串,只包含小写字母,x为一原创 2014-10-08 20:07:39 · 955 阅读 · 0 评论