随笔分类 - 字符串-后缀数组
摘要:地址:http://www.lydsy.com/JudgeOnline/problem.php?id=3238 题目: 3238: [Ahoi2013]差异 Description Input 一行,一个字符串S 一行,一个字符串S Output 一行,一个整数,表示所求值 一行,一个整数,表示所求
阅读全文
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6194 题目: string string string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (J
阅读全文
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=3518 题目: Boring counting Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/O
阅读全文
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=1403 题目: Longest Common Substring Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/32768
阅读全文
摘要:地址:http://poj.org/problem?id=1743 题目: Musical Theme Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 28675 Accepted: 9674 Description A musi
阅读全文
摘要:地址:http://acm.uestc.edu.cn/#/problem/show/1551 题目: Hesty Str1ng Hesty Str1ng Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/O
阅读全文
摘要:题目地址:http://poj.org/problem?id=3261 题目: Description Farmer John has noticed that the quality of milk given by his cows varies from day to day. On furt
阅读全文
摘要:后缀数组 DA(倍增)算法求 SA[N] 与 Rank[N] (时间O(NlogN),空间O(N)) sa[i] : 表示 排在第i位的后缀 起始下标 rank[i] : 表示后缀 suffix(i)排在第几 height[i] : 表示 sa[i-1] 与 sa[i] 的LCP 值 h[i]: 表
阅读全文

浙公网安备 33010602011771号