随笔分类 -  字符串——后缀数组

loj2059 「TJOI / HEOI2016」字符串
摘要："字符串好难啊不会啊" cpp include include using namespace std; int n, m, rnk[100005], cnt[100005], tmp[100005], p, mx=128, saa[100005], tot, a, b; int height[10 阅读全文
posted @ 2018-05-07 10:59 poorpool 阅读(357) 评论(0) 推荐(0)
luogu2870 [USACO07DEC]最佳牛线，黄金Best Cow Line, Gold
摘要："ref" cpp include include include using namespace std; int nn, n, rnk[60005], tmp[60005], cnt[60005], m=128, p, saa[60005]; char s[15], ss[60005]; voi 阅读全文
posted @ 2018-04-23 19:35 poorpool 阅读(125) 评论(0) 推荐(0)
spoj694 DISUBSTR - Distinct Substrings
摘要：不相同子串个数。 参考那篇论文。 cpp include include include using namespace std; int n, m, p, x[1005], y[1005], c[1005], sa[1005], rnk[1005], hei[1005]; int ans, T; 阅读全文
posted @ 2018-01-11 09:07 poorpool 阅读(114) 评论(0) 推荐(0)
luogu2852 [USACO06DEC]牛奶模式Milk Patterns
摘要：参考那篇经典论文。 cpp include include include using namespace std; int n, k, r[20005], x[20005], y[20005], sa[20005], rank[20005], hei[20005]; int m=1000005, 阅读全文
posted @ 2018-01-10 20:56 poorpool 阅读(131) 评论(0) 推荐(0)
poj2217 Secretary 后缀数组
摘要：```cpp include include include include using namespace std; int T, n, m, p, len, r[20005], c[20005], x[20005], y[20005], sa[20005]; int rank[20005], a 阅读全文
posted @ 2018-01-10 08:42 poorpool 阅读(106) 评论(0) 推荐(0)
luogu3809 后缀排序 后缀数组
摘要："ref" and 挑战程序设计竞赛。 ~~主要是发现自己以前写得代码太难看而且忘光了，而且我字符串死活学不会啊，kmp这种东西我都觉得是省选+难度啊QAQ~~ cpp include include include using namespace std; int n, cnt[1000005], 阅读全文
posted @ 2018-01-09 16:55 poorpool 阅读(201) 评论(5) 推荐(0)