后缀数组
newhonor
可以不伟大,但不能卑微
展开
-
D - Life Forms POJ - 3294
https://cn.vjudge.net/contest/311974#problem/D坑:间隔符要不同,超出ascii不能用char处理了!!!!#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <qu...原创 2019-08-07 23:10:05 · 101 阅读 · 0 评论 -
2019中国大学生程序设计竞赛(CCPC) - 网络选拔赛 K-th occurrence
http://acm.hdu.edu.cn/showproblem.php?pid=6704注意后缀数组初始化!!!#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include &l...原创 2019-08-24 19:18:43 · 313 阅读 · 0 评论 -
C - Milk Patterns POJ - 3261
https://cn.vjudge.net/contest/311974#problem/C总结:后缀数组;lcp(最长公共前缀)sa[i]表示:排名i的串是在那个下标开始(就是是啥串);height[i]表示:排名i和i-1的lcp;即等于LCP(i,i-1)rk[i]表示:下标i开始的串排名是多少;LCP(i,j)=LCP(j,i); LCP(i,i)=len(sa[...原创 2019-08-07 17:02:25 · 122 阅读 · 0 评论 -
B - Long Long Message POJ - 2774
https://cn.vjudge.net/contest/311974#problem/B思路:求两串最长公共子串#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include &...原创 2019-08-07 16:36:29 · 263 阅读 · 0 评论 -
A - Musical Theme POJ - 1743
https://cn.vjudge.net/contest/311974#problem/A总结:最长不重叠重复子串;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include &...原创 2019-08-07 16:22:56 · 67 阅读 · 0 评论 -
P3809 【模板】后缀排序
https://www.luogu.org/problem/P3809#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <map>#include <se...原创 2019-08-07 10:27:46 · 92 阅读 · 0 评论 -
G - Distinct Substrings SPOJ - DISUBSTR
https://cn.vjudge.net/contest/311974#problem/G题意:求不同子串数量;思路:减掉height[i]是减掉以sa[i]开头的串的数量;无需减掉它的子串;因为之后会处理掉(它的子串sa[i]不同)#include <iostream>#include <cstring>#include <algorithm...原创 2019-08-08 16:35:29 · 109 阅读 · 0 评论 -
Longest Common Substring
http://acm.hdu.edu.cn/showproblem.php?pid=1403#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <map>...原创 2019-08-08 15:42:11 · 115 阅读 · 0 评论 -
E - Common Substrings POJ - 3415
https://cn.vjudge.net/contest/311974#problem/E思路:单调栈计算; 计算A对B的贡献再计算B对A的贡献;A对B:遇到B串时,计算其和前面的串的贡献;而它和前面的lcp是的最小值;故维护栈单调递增;计算方法:按前面最大贡献计算;一旦遇到比栈顶小就将栈顶的贡献减掉;#include <iostream>#include <cs...原创 2019-08-08 15:40:51 · 94 阅读 · 0 评论 -
Mediocre String Problem Gym - 101981M
https://cn.vjudge.net/problem/Gym-101981M很容易tle#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>...原创 2019-08-16 15:29:47 · 182 阅读 · 0 评论