字符串处理
文章平均质量分 63
JacquesdeH
.
展开
-
HDU2087 剪花布条 [KMP]
剪花布条 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都原创 2016-07-26 23:50:43 · 363 阅读 · 0 评论 -
HDU 2609 How Many [最小表示法] [字符串处理]
How many Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me How原创 2016-10-04 22:22:41 · 397 阅读 · 0 评论 -
POJ 3617 Best Cow Line [贪心] [字典序最小]
POJ 3617 Best Cow Line 给定长度为n 的字符串S,现要构造一个长度为n 的字符串T. 初始T 为空串,随后可以从S 头部删除一个字符加到T 的尾部,或是从S 尾部删除一个字符加到T 的尾部,求字典序最小的T 1 <=n<=2000那么直接比较两个指针的值是不完全正确的,因为还有相同的情况,为了让字典序最小,需要继续比较指针下一个位置的值,知道两个指针相遇或者有不相同的停原创 2016-10-04 20:31:17 · 341 阅读 · 0 评论 -
UVAlive 4670 Dominating Patterns [AC自动机]
Dominating Patterns Time Limit: 3000MS 64bit IO Format: %lld & %lluThe archaeologists are going to decipher a very mysterious “language”. Now, they know many language patterns; each pattern原创 2016-07-27 00:03:10 · 470 阅读 · 0 评论 -
UVA 1626 Brackets Sequence [最优矩阵链乘变式] [线性结构dp]
Brackets sequence Time Limit: 4500MS 64bit IO Format: %lld & %lluDescription Let us define a regular brackets sequence in the following way: Empty sequence is a regular sequence. If S is a原创 2016-08-24 11:20:38 · 437 阅读 · 0 评论 -
HDU 3068 最长回文 [Manacher回文串]
最长回文 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17805 Accepted Submission(s): 6568Problem Description 给出一个只由小写英文字符a,b,c…y,z组成的字符串S,求S原创 2016-09-09 21:42:16 · 324 阅读 · 0 评论 -
UVA 11468 Substring [AC自动机] [全概率公式]
Substring Time Limit: 10000MS 64bit IO Format: %lld & %lluGiven a set of pattern strings, and a text, you have to find, if any of the pattern is a substring of the text. If any of the pattern string原创 2016-07-27 23:07:21 · 346 阅读 · 0 评论 -
HDU 1403 Longest Common Substrung [后缀数组] [LCP] [LCS]
Longest Common Substring Time Limit: 4000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription Given two strings, you have to tell the length of the Longest Common Substring of them. F原创 2016-07-31 10:49:44 · 920 阅读 · 0 评论 -
HDU 4691 Front Compression [后缀数组] [LCP]
Front compression Time Limit: 5000MS Memory Limit: 102400KB 64bit IO Format: %I64d & %I64uDescription Front compression is a type of delta encoding compression algorithm whereby common prefixes and原创 2016-07-30 13:02:32 · 339 阅读 · 0 评论 -
Tyvj 1860 后缀数组 [Suffix Array 裸题]
一句话,输出文本串的sa数组和height数组要注意细节!!! 注意rank下标 0~lens-1 ;而 sa下标 1~lens ;height下标为2~lens 所以带入da() 时 lens要+1!! 还有在读入时注意不要使用0,从1开始!! 否则后面判断相等时可能会dead loop!!另外坑father的地方!! 用printf直接T 但是用cout却不会??!!! yyr大神说可以原创 2016-07-29 21:16:45 · 379 阅读 · 0 评论 -
UVAlive 3026 Period [KMP]
Period Time Limit: 3000MS 64bit IO Format: %lld & %lluFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether原创 2016-07-27 00:43:46 · 313 阅读 · 0 评论 -
HDU2222 Keywords Search [AC自动机]
Keywords Search Time Limit: 1000MS Memory Limit: 131072KB 64bit IO Format: %I64d & %I64uDescription In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wisk原创 2016-07-26 23:58:38 · 316 阅读 · 0 评论 -
NOIP模拟题 2016.11.14 [动态规划] [线段树优化DP] [字符串的复制粘贴DP]
复制&粘贴2(A.c/cpp/pas/in/out) (Time Limit:1s Memory Limit:256MB) 【Description】 文本编辑器的一个最重要的机能就是复制&粘贴。JOI社现在正在开发一款能够非常高速地进行复制&粘贴的文本编辑器,作为JOI社一名优秀的程序猿,你担负起了复制&粘贴功能的测试这一核心工作。整个JOI社的命运都系在你的身上,因此你无论如何都想写出一个原创 2016-11-14 15:17:22 · 1155 阅读 · 0 评论