https://111qqz.com/en/tags/%E5%9B%9E%E6%96%87%E8%87%AA%E5%8A%A8%E6%9C%BA/Recent content in 回文自动机 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzTue, 14 Nov 2017 12:45:08 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-2014-xian-acm-icpc-regional-contest-problem-g/Tue, 14 Nov 2017 12:45:08 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-2014-xian-acm-icpc-regional-contest-problem-g/<p><a href="http://codeforces.com/gym/100548" target="_blank" rel="noreferrer">http://codeforces.com/gym/100548</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>切换面板：标签 标签 添加新标签  回文自动机、 给2个字符串，问2个字符串中，相等并且都是回文串的对数。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-bzoj-2160/Tue, 14 Nov 2017 11:50:39 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-bzoj-2160/<h2 class="relative group">2160: 拉拉队排练 <div id="2160-拉拉队排练" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#2160-%e6%8b%89%e6%8b%89%e9%98%9f%e6%8e%92%e7%bb%83" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 10 Sec  Memory Limit: 259 MB Submit: 1938  Solved: 743 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=2160" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=2160" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=2160" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-ural-1960/Mon, 13 Nov 2017 18:14:23 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-ural-1960/<p><a href="http://acm.timus.ru/problem.aspx?space=1&amp;num=1960" target="_blank" rel="noreferrer">http://acm.timus.ru/problem.aspx?space=1&num=1960</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给一个字符串S,依次输出字符串S的所有前缀中，本质不同的回文串个数。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-bzoj-2565/Mon, 13 Nov 2017 18:02:49 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-bzoj-2565/<h2 class="relative group">Description <div id="description" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor">#</a> </span> </h2> <p>顺序和逆序读起来完全一样的串叫做回文串。比如acbca是回文串，而abc不是（abc的顺序为“abc”，逆序为“cba”，不相同）。 输入长度为n的串S，求S的最长双回文子串T,即可将T分为两部分X，Y，（|X|,|Y|≥1）且X和Y都是回文串。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-hdu-3948/Mon, 13 Nov 2017 15:56:30 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-hdu-3948/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3948" target="_blank" rel="noreferrer">http://acm.hdu.edu.cn/showproblem.php?pid=3948</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给一个字符串，问本质不同的回文子串的个数。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-uoj-103/Mon, 13 Nov 2017 15:25:57 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-uoj-103/<p><a href="http://uoj.ac/problem/103" target="_blank" rel="noreferrer">http://uoj.ac/problem/103</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给你一个由小写拉丁字母组成的字符串 s。我们定义 s 的一个子串的存在值为这个子串在 s 中出现的次数乘以这个子串的长度。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-22-e59b9ee69687e887aae58aa8e69cbae5ada6e4b9a0e7ac94e8aeb0/Thu, 22 Sep 2016 09:36:22 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-22-e59b9ee69687e887aae58aa8e69cbae5ada6e4b9a0e7ac94e8aeb0/<p>是14年才被提出来的算法&hellip; 先%一下该算法的作者：<a href="http://codeforces.com/profile/MikhailRubinchik" target="_blank" rel="noreferrer">作者的codeforces页</a></p>