https://111qqz.com/en/tags/%E5%90%8E%E7%BC%80%E6%95%B0%E7%BB%84/Recent content in 后缀数组 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzSat, 27 Aug 2016 07:37:23 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-27-seerc-2014-circle-of-digits-e4ba8ce58886e5908ee7bc80e695b0e7bb84/Sat, 27 Aug 2016 07:37:23 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-27-seerc-2014-circle-of-digits-e4ba8ce58886e5908ee7bc80e695b0e7bb84/<p><a href="http://acm.hust.edu.cn/vjudge/contest/130303#problem/B" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：把一个长度为n的只由数字构成的串分成k个不为空的字串，使得最大的串最小（大小是说串所对应的十进制数的大小）</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-cf-123/Tue, 02 Aug 2016 15:23:55 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-cf-123/<p><a href="http://codeforces.com/problemset/problem/123/D" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：定义一个函数F．．</p> <blockquote><p>For exampe: <em>F</em>(<em>babbabbababbab</em>, <em>babb</em>) = 6. The list of pairs is as follows:</p> <p>(1, 4), (4, 7), (9, 12)</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-2406/Tue, 02 Aug 2016 13:49:47 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-poj-2406/<p><a href="http://poj.org/problem?id=2406" target="_blank" rel="noreferrer">poj 2406</a></p> <p>题意:给定一个字符串 L,已知这个字符串是由某个字符串 S 重复 R 次而得到的, 求 R 的最大值</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-spoj-subst1-new-distinct-substringse5908ee7bc80e695b0e7bb84/Tue, 02 Aug 2016 10:50:52 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-02-spoj-subst1-new-distinct-substringse5908ee7bc80e695b0e7bb84/<p><a href="http://www.spoj.com/problems/SUBST1/en/" target="_blank" rel="noreferrer">题目连接</a></p> <p>题意：求所有不同的子串个数。</p> <p>思路：后缀数组。和上一道题一样，就是数据范围变成了 5E4&hellip;1A</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-spoj-disubstr/Sun, 31 Jul 2016 19:31:42 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-spoj-disubstr/<p><a href="http://www.spoj.com/problems/DISUBSTR/en/" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：给出一个字符串，问所有不同的字串的个数。</p> <p>思路：直接求比较困难。我们考虑，假如组成字符串的所有字符都不相同，那么就没有相同的字串，假设字符串的长度为n，那么长度为1的子串有n个，为2的有n-1个。。。为n的有1个，一共就是n*(n+1)/2个。。但是实际上会有重复的。。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-poj-3261/Sun, 31 Jul 2016 18:18:04 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-poj-3261/<p><a href="http://poj.org/problem?id=3261" target="_blank" rel="noreferrer">poj3261</a></p> <p>题意：给一个字符串，要求找出至少出现k次的最长重复子串&hellip;</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-poj-1743-musical-theme-e4b88de58fafe9878de58fa0e69c80e995bfe9878de5a48de5ad90e4b8b2efbc8ce5908ee7bc80e695b0e7bb84/Sun, 31 Jul 2016 16:38:25 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-31-poj-1743-musical-theme-e4b88de58fafe9878de58fa0e69c80e995bfe9878de5a48de5ad90e4b8b2efbc8ce5908ee7bc80e695b0e7bb84/<p><a href="http://poj.org/problem?id=1743" target="_blank" rel="noreferrer">poj 1743</a></p> <p>题意：n个数字（1..88）表示的音符，问最长的连续两段长度至少为5的变化相同的音符段的长度。。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-ural1517/Sat, 30 Jul 2016 17:18:19 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-ural1517/<p><a href="http://acm.timus.ru/problem.aspx?space=1&amp;num=1517" target="_blank" rel="noreferrer">ural1517</a> 题意：给出两个字符串，求最长的公共字串（要求出具体的字符串是什么）</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-poj-2774/Sat, 30 Jul 2016 16:02:42 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-poj-2774/<p><a href="http://poj.org/problem?id=2774" target="_blank" rel="noreferrer">poj2774</a></p> <p>题意：给出两个字符串，问最长的公共连续字串。</p> <p>思路：后缀数组模板题。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-suffix_array_tutorial/Sat, 30 Jul 2016 09:12:57 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-30-suffix_array_tutorial/<p>原文链接：<a href="https://discuss.codechef.com/questions/21385/a-tutorial-on-suffix-arrays" target="_blank" rel="noreferrer">链接</a></p> <p>讲了后缀数组的概念，然后从最暴力的O(n<em>n</em>logn )的复杂度(O(n)用来比较字符串，O(nlogn)是排序的复杂度)逐步优化，依据各个串之间的关系，大概讲了倍增算法，以及给出了一篇The Skew Algorithm 的论文。</p>