<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>后缀自动机 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E5%90%8E%E7%BC%80%E8%87%AA%E5%8A%A8%E6%9C%BA/</link><description>Recent content in 后缀自动机 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Mon, 13 Nov 2017 11:03:24 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%90%8E%E7%BC%80%E8%87%AA%E5%8A%A8%E6%9C%BA/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 123D. String(后缀自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-codeforces-123d/</link><pubDate>Mon, 13 Nov 2017 11:03:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-codeforces-123d/</guid><description>&lt;p&gt;题目链接：http://codeforces.com/problemset/problem/123/D&lt;/p&gt;</description></item><item><title>poj 3415 Common Substrings (后缀自动机+parent树上的lazy标记)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-12-poj-3415/</link><pubDate>Sun, 12 Nov 2017 12:40:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-12-poj-3415/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3415" target="_blank" rel="noreferrer"&gt;http://poj.org/problem?id=3415&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给出两个字符串，问公共长度大于等于k的子串个数（只要两个串的位置不同就认为是不同）&lt;/p&gt;</description></item><item><title>hdu 4416 Good Article Good sentence (后缀自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-4416/</link><pubDate>Sat, 11 Nov 2017 22:44:03 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-4416/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4416" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=4416&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给出一个字符串A和n个字符串B,问A的子串中，不在任何一个B中出现的本质不同的子串有多少。&lt;/p&gt;</description></item><item><title>hdu 3518 Boring counting (后缀自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-3518/</link><pubDate>Sat, 11 Nov 2017 21:14:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-3518/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=3518" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=3518&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给一个字符串，问字符串中，至少出现2次且不相交的本质不同的子串有多少个。本质不同给的子串是说存在至少一位的字母不同。&lt;/p&gt;</description></item><item><title>hdu 5558 | 2015ACM/ICPC亚洲区合肥站 G Alice's Classified Message (后缀自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-5558/</link><pubDate>Sat, 11 Nov 2017 14:34:06 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-5558/</guid><description>&lt;h1 class="relative group"&gt;题目链接：
 &lt;div id="题目链接" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e7%9b%ae%e9%93%be%e6%8e%a5" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=5558" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=5558&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;说了一大堆。。其实就是询问位置i开始的后缀和以位置[0&amp;hellip;i - 1]开始的所有后缀中最大匹配的公共前缀长度&lt;/p&gt;</description></item><item><title>SPOJ LCS2 Longest Common Substring 2[后缀自动机+dp]</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-spoj-lcs2/</link><pubDate>Sat, 11 Nov 2017 07:11:25 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-spoj-lcs2/</guid><description>&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;求n个串的最长公共子串，n&amp;lt;=10&lt;/p&gt;</description></item><item><title>hdu 4436 | 2012 Asia Tianjin Regional Contest str2int (dp+后缀自动机，多串建立)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-09-hdu-4436/</link><pubDate>Thu, 09 Nov 2017 05:55:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-09-hdu-4436/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4436" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=4436&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给出n个仅由数字组成的字符串，问n个字符串的所有不同子串的和。&lt;/p&gt;</description></item><item><title>SPOJ SUBLEX Lexicographical Substring Search （ 后缀自动机）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-spoj-sublex/</link><pubDate>Wed, 08 Nov 2017 13:15:20 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-spoj-sublex/</guid><description>&lt;p&gt;&lt;a href="http://www.spoj.com/problems/SUBLEX/en/" target="_blank" rel="noreferrer"&gt;http://www.spoj.com/problems/SUBLEX/en/&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给一个字符串，每次询问字典序第k大的不重复子串。&lt;/p&gt;</description></item><item><title>spoj nsubstr Substrings (后缀自动机 模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-spoj-nsubstr/</link><pubDate>Wed, 08 Nov 2017 12:16:05 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-spoj-nsubstr/</guid><description>&lt;p&gt;&lt;a href="http://www.spoj.com/problems/NSUBSTR/en/" target="_blank" rel="noreferrer"&gt;http://www.spoj.com/problems/NSUBSTR/en/&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;f[i]指长度为i的串出现次数的最大值。这里的不同出现指，可以有重复串，只要起始位置不同就视为不同的出现。&lt;/p&gt;</description></item><item><title>【施工中】SAM学习笔记</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-suffix-automaton-notes/</link><pubDate>Sat, 04 Nov 2017 07:07:26 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-suffix-automaton-notes/</guid><description>&lt;blockquote&gt;&lt;p&gt;&lt;em&gt;&lt;strong&gt;在学习后缀自动机之前需要熟练掌握WA自动机、RE自动机与TLE自动机&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;</description></item><item><title>poj 1509 Glass Beads (后缀自动机求最小循环表示)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-poj-1509/</link><pubDate>Sat, 04 Nov 2017 06:58:49 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-poj-1509/</guid><description>&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给定一个循环字符串，问字典序最小的串的开始位置。&lt;/p&gt;</description></item><item><title>hdu 4622 | 2013 Multi-University Training Contest 3 Reincarnation (后缀自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-hdu-4622/</link><pubDate>Sat, 04 Nov 2017 04:31:38 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-04-hdu-4622/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4622" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=4622&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给一个字符串，给出若干询问，每组询问给一个区间[l,r]，问区间中本质不同的字符串的个数。&lt;/p&gt;</description></item><item><title>SPOJ LCS Longest Common Substring （后缀自动机模板题）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-03-spoj-lcs/</link><pubDate>Fri, 03 Nov 2017 11:44:35 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-03-spoj-lcs/</guid><description>&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给出2个字符串(2.5E5)，问最长公共子串的长度。&lt;/p&gt;</description></item></channel></rss>