<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ACM on 111qqz's blog</title><link>https://111qqz.com/en/categories/acm/</link><description>Recent content in ACM on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sun, 06 Jan 2019 06:43:12 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/categories/acm/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces round 530 div2</title><link>https://111qqz.com/en/post/acm-icpc/2019-01-06-codeforces-round-530-div2/</link><pubDate>Sun, 06 Jan 2019 06:43:12 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2019-01-06-codeforces-round-530-div2/</guid><description>&lt;p&gt;A,B,C:都很简单，不说了。&lt;/p&gt;
&lt;p&gt;D:一棵树，给出树的结构，以及从树根到某个深度为偶数的节点的路径和，问能否构造一种所有节点点权和最小的树，输出最小点权和。&lt;/p&gt;</description></item><item><title>codeforces hello 2019</title><link>https://111qqz.com/en/post/acm-icpc/2019-01-05-codeforces-hello-2019/</link><pubDate>Sat, 05 Jan 2019 06:29:49 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2019-01-05-codeforces-hello-2019/</guid><description>&lt;p&gt;好久没玩cf了，竟然还能涨分（虽然我用的小号Orz)&lt;/p&gt;
&lt;p&gt;三题，D应该是数学+DP&amp;hellip;数学实在是忘干净了。。。&lt;/p&gt;</description></item><item><title>codeforces 501 B. Obtaining the String</title><link>https://111qqz.com/en/post/acm-icpc/2017/2018-10-03-codeforces-501-b-obtaining-the-string/</link><pubDate>Wed, 03 Oct 2018 10:15:31 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2018-10-03-codeforces-501-b-obtaining-the-string/</guid><description>&lt;p&gt;题目链接:http://codeforces.com/contest/1015/problem/B&lt;/p&gt;</description></item><item><title>codeforces edu #51 C. Vasya and Multisets (思维题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2018-10-02-codeforces-edu-51-c/</link><pubDate>Tue, 02 Oct 2018 10:49:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2018-10-02-codeforces-edu-51-c/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/contest/1051/problem/C" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意:有n个数，现在要分成2个集合，使得2个集合中，仅出现1次的数的个数相同，问是否有解，以及具体的分法。&lt;/p&gt;</description></item><item><title>2017 ACM-ICPC Beijing Regional 总结</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-21-2017-2017-acm-icpc-beijing-regional/</link><pubDate>Tue, 21 Nov 2017 05:27:58 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-21-2017-2017-acm-icpc-beijing-regional/</guid><description>&lt;p&gt;emmm 最后一场，果然还是写点什么记录一下吧。&lt;/p&gt;

&lt;h2 class="relative group"&gt;DAY 0
 &lt;div id="day-0" 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="#day-0" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;到宾馆已经晚上八点了，惊讶得发现宾馆和15年来参加regional的是同一个，于是戳了下当时和我们一起来的@Always队的三个已经毕业的学长，求了波rp2333&lt;/p&gt;</description></item><item><title>2014 Xi'An ACM-ICPC Regional Contest Problem G. The Problem to Slow Down You (回文自动机(模块化写法))</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-2014-xian-acm-icpc-regional-contest-problem-g/</link><pubDate>Tue, 14 Nov 2017 12:45:08 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-2014-xian-acm-icpc-regional-contest-problem-g/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/gym/100548" target="_blank" rel="noreferrer"&gt;http://codeforces.com/gym/100548&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个字符串，问2个字符串中，相等并且都是回文串的对数。&lt;/p&gt;</description></item><item><title>bzoj 2160: 拉拉队排练 (回文自动机+快速幂)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-bzoj-2160/</link><pubDate>Tue, 14 Nov 2017 11:50:39 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-14-bzoj-2160/</guid><description>&lt;h2 class="relative group"&gt;2160: 拉拉队排练
 &lt;div id="2160-拉拉队排练" 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="#2160-%e6%8b%89%e6%8b%89%e9%98%9f%e6%8e%92%e7%bb%83" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 259 MB
Submit: 1938  Solved: 743
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=2160" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=2160" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=2160" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>ural 1960. Palindromes and Super Abilities (回文自动机，统计本质不同的回文串个数)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-ural-1960/</link><pubDate>Mon, 13 Nov 2017 18:14:23 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-ural-1960/</guid><description>&lt;p&gt;&lt;a href="http://acm.timus.ru/problem.aspx?space=1&amp;amp;num=1960" target="_blank" rel="noreferrer"&gt;http://acm.timus.ru/problem.aspx?space=1&amp;num=1960&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;给一个字符串S,依次输出字符串S的所有前缀中，本质不同的回文串个数。&lt;/p&gt;</description></item><item><title>BZOJ 2565: 最长双回文串 (回文自动机)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-bzoj-2565/</link><pubDate>Mon, 13 Nov 2017 18:02:49 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-bzoj-2565/</guid><description>&lt;h2 class="relative group"&gt;Description
 &lt;div id="description" 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="#description" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;顺序和逆序读起来完全一样的串叫做回文串。比如acbca是回文串，而abc不是（abc的顺序为“abc”，逆序为“cba”，不相同）。
输入长度为n的串S，求S的最长双回文子串T,即可将T分为两部分X，Y，（|X|,|Y|≥1）且X和Y都是回文串。&lt;/p&gt;</description></item><item><title>hdu 3948 | 2011 Multi-University Training Contest 11 The Number of Palindromes (回文自动机模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-hdu-3948/</link><pubDate>Mon, 13 Nov 2017 15:56:30 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-hdu-3948/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=3948" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=3948&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;给一个字符串，问本质不同的回文子串的个数。&lt;/p&gt;</description></item><item><title>UOJ #103. 【APIO2014】Palindromes (回文自动机模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-uoj-103/</link><pubDate>Mon, 13 Nov 2017 15:25:57 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-13-uoj-103/</guid><description>&lt;p&gt;&lt;a href="http://uoj.ac/problem/103" target="_blank" rel="noreferrer"&gt;http://uoj.ac/problem/103&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;给你一个由小写拉丁字母组成的字符串 s。我们定义 s 的一个子串的存在值为这个子串在 s 中出现的次数乘以这个子串的长度。&lt;/p&gt;</description></item><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 6059 | 2017 Multi-University Training Contest - Team 3 Kanade's trio (trie)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-6059/</link><pubDate>Sat, 11 Nov 2017 18:04:34 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-6059/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6059" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6059&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 个数字的 A 数组，求有多少个三元组 &lt;code&gt;(i,j,k)&lt;/code&gt; 满足 i&amp;lt;j&amp;lt;k 且a[i]^a[j] &amp;lt; a[j]^a[k]&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 4819 2013 Asia Regional Changchun G (四叉树|| 二维线段树单点更新 模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-09-hdu-4819/</link><pubDate>Thu, 09 Nov 2017 12:59:36 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-09-hdu-4819/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4819" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=4819&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的矩阵， 每个点是一个数字， Q个操作，每次选择一个子矩阵， 把中心元素替换成子矩阵中最大值和最小值之和的二分之一。&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>poj 1949 Chores (拓扑排序+dp)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-poj-1949/</link><pubDate>Wed, 08 Nov 2017 08:02:31 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-poj-1949/</guid><description>&lt;h1 class="relative group"&gt;&lt;a href="http://poj.org/problem?id=1949" target="_blank" rel="noreferrer"&gt;http://poj.org/problem?id=1949&lt;/a&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="#" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&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个任务，第i个任务需要时间xi来完成，并且第i个任务必须在它 “前面的” 某些任务完成之后才能开始。&lt;/p&gt;</description></item><item><title>hdu 4777 Rabbit Kingdom (树状数组+预处理)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-hdu-4777/</link><pubDate>Wed, 08 Nov 2017 07:05:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-08-hdu-4777/</guid><description>&lt;p&gt;&lt;a href="https://vjudge.net/problem/47450/origin" target="_blank" rel="noreferrer"&gt;https://vjudge.net/problem/47450/origin&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个数的序列，m个询问。问 [l, r] 区间内与所有数都互质的数有几个？&lt;/p&gt;</description></item><item><title>poj 3249 Test for Job (拓扑排序+dp)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-07-poj-3249/</link><pubDate>Tue, 07 Nov 2017 06:13:22 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-07-poj-3249/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3249" target="_blank" rel="noreferrer"&gt;http://poj.org/problem?id=3249&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;给一个DAG,现要从一条入度为0的点到一个出度为0的点，问最大点权和。&lt;/p&gt;</description></item><item><title>hdu 6048 | 2017 Multi-University Training Contest - Team 2 D Puzzle (结论题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-6048/</link><pubDate>Mon, 06 Nov 2017 11:09:10 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-6048/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6048" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6048&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 * m - 1 个数，每次选择第 1,p + 1,p * 2 + 1…..
的顺序选择数，&lt;strong&gt;先按左到右，再按从上到下的顺序&lt;/strong&gt;填入n * m 的格子，空格子可以和相邻的数字交换位置，问最后能否在格子中形成 1~ n * m - 1的数按从左到右，从上到下的顺序。&lt;/p&gt;</description></item><item><title>hdu 4782 | 2013 Asia Chengdu Regional Contest B (模拟)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-4782/</link><pubDate>Mon, 06 Nov 2017 09:42:38 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-06-hdu-4782/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4782" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=4782&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;将格式混乱的html代码输出成标准格式。&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><item><title>HDU 5970 | 2016 CCPC HeFei onsite J 最大公约数 (打表找规律)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-02-hdu-5970/</link><pubDate>Thu, 02 Nov 2017 02:33:54 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-02-hdu-5970/</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;有这样一个有关最大公约数的函数:
函数 f(x, y):&lt;/p&gt;</description></item><item><title>hdu 6038 | 2017 Multi-University Training Contest - Team 1 E Function (置换群找循环节)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-hdu-6038/</link><pubDate>Wed, 01 Nov 2017 06:47:11 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-hdu-6038/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6038" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6038&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 和 b ，求满足  f[i]= b_{f[a[i]]} 的函数个数。&lt;/p&gt;</description></item><item><title>hdu 6034 2017 Multi-University Training Contest - Team 1 B Balala Power! (贪心)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-hdu-6034/</link><pubDate>Wed, 01 Nov 2017 04:00:01 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-hdu-6034/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6034" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6034&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..z的字母，对应到0..25，每个数字只能被一个字母对应，得到一个26进制的数，现在问这个数最大是多少。注意不允许有前导0，除非这个数本身就是0.&lt;/p&gt;</description></item><item><title>BZOJ 1230: [Usaco2008 Nov]lites 开关灯 (线段树区间修改，区间查询)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-bzoj-1230/</link><pubDate>Wed, 01 Nov 2017 02:19:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-01-bzoj-1230/</guid><description>&lt;h2 class="relative group"&gt;1230: [Usaco2008 Nov]lites 开关灯
 &lt;div id="1230-usaco2008-novlites-开关灯" 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="#1230-usaco2008-novlites-%e5%bc%80%e5%85%b3%e7%81%af" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 162 MB
Submit: 1676  Solved: 874
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1230" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1230" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1230" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>hdu 6043 | 2017 Multi-University Training Contest - Team 1 K KazaQ's Socks （循环节）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-hdu-6043-2017-multi-university-training-contest-team-1-k-kazaqs-socks-efbc88e5beaae78eafe88a82efbc89/</link><pubDate>Tue, 31 Oct 2017 16:31:10 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-hdu-6043-2017-multi-university-training-contest-team-1-k-kazaqs-socks-efbc88e5beaae78eafe88a82efbc89/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6043" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6043&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双袜子标号1到n，初始在抽屉里，每天早晨&lt;strong&gt;穿一双标号最小的袜子&lt;/strong&gt;，晚上把脏袜子放到盆里，如果放完之后喷子里已经有了n-1双脏袜子，那么就要洗，然后在第二天晚上放回抽屉里。问第k天穿的是标号为几的袜子。&lt;/p&gt;</description></item><item><title>hdu 6033 | 2017 Multi-University Training Contest - Team 1 A Add More Zero</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-hdu6033/</link><pubDate>Tue, 31 Oct 2017 15:51:43 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-hdu6033/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6033" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6033&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;问最大的x,满足  &lt;/p&gt;</description></item><item><title>bzoj 1059: [ZJOI2007]矩阵游戏 (匈牙利算法)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-bzoj-1059/</link><pubDate>Tue, 31 Oct 2017 14:49:12 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-bzoj-1059/</guid><description>&lt;h2 class="relative group"&gt;1059: [ZJOI2007]矩阵游戏
 &lt;div id="1059-zjoi2007矩阵游戏" 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="#1059-zjoi2007%e7%9f%a9%e9%98%b5%e6%b8%b8%e6%88%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 162 MB
Submit: 5251  Solved: 2512
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1059" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1059" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1059" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>BZOJ 1191: [HNOI2006]超级英雄Hero (匈牙利)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-bzoj-1191/</link><pubDate>Tue, 31 Oct 2017 13:40:03 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-31-bzoj-1191/</guid><description>&lt;h2 class="relative group"&gt;1191: [HNOI2006]超级英雄Hero
 &lt;div id="1191-hnoi2006超级英雄hero" 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="#1191-hnoi2006%e8%b6%85%e7%ba%a7%e8%8b%b1%e9%9b%84hero" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 162 MB
Submit: 5221  Solved: 2356
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1191" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1191" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1191" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>codeforces div 1 443 A. Short Program （位运算的理解）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-29-codeforces-div1-443a/</link><pubDate>Sun, 29 Oct 2017 11:24:42 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-29-codeforces-div1-443a/</guid><description>&lt;p&gt;题目链接：&lt;/p&gt;
&lt;p&gt;&lt;a href="http://codeforces.com/contest/878/problem/A" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;&lt;strong&gt;题意：&lt;/strong&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;一段程序，最多5E5个操作，每个操作的格式为 &amp;lt;opt,x&amp;gt; ，opt表示位或，位异或，位与 三种位运算的一种，x表示范围0..1023的数。现在要求将该程序化简至最多 5个操作，使得对于0..1023的输入，输出与该程序同样的结果。&lt;/p&gt;</description></item><item><title>2016 ICPC 大连 区域赛 A Wrestling Match （交叉染色法判断二分图）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-26-2016-icpc-dalian-regional-a/</link><pubDate>Thu, 26 Oct 2017 09:16:15 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-26-2016-icpc-dalian-regional-a/</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个点m条边，以及已知的好点和坏点。一个边连接的2个点一定是一好一坏，问是否有合法方案，使得每个点被确定好坏。&lt;/p&gt;</description></item><item><title>codeforces #346 div 2 E. New Reform (和图有关的的计数)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-codeforces-346-div2-e/</link><pubDate>Wed, 25 Oct 2017 13:09:31 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-codeforces-346-div2-e/</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个点，条边的无向图，无重边，无自环。现在要求把所有的无向边换成有向边，使得入度为0的点最少。问最少的入度为0的点是多少。&lt;/p&gt;</description></item><item><title>BZOJ 1854: [Scoi2010]游戏 (并查集)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-bzoj-1854/</link><pubDate>Wed, 25 Oct 2017 10:49:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-bzoj-1854/</guid><description>&lt;h2 class="relative group"&gt;Description
 &lt;div id="description" 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="#description" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;lxhgww最近迷上了一款游戏，在游戏里，他拥有很多的装备，每种装备都有2个属性，这些属性的值用[1,10000]之间的数表示。当他使用某种装备时，他只能使用该装备的某一个属性。并且每种装备最多只能使用一次。 游戏进行到最后，lxhgww遇到了终极boss，这个终极boss很奇怪，攻击他的装备所使用的属性值必须从1开始连续递增地攻击，才能对boss产生伤害。也就是说一开始的时候，lxhgww只能使用某个属性值为1的装备攻击boss，然后只能使用某个属性值为2的装备攻击boss，然后只能使用某个属性值为3的装备攻击boss……以此类推。 现在lxhgww想知道他最多能连续攻击boss多少次？&lt;/p&gt;</description></item><item><title>codeforces 439 C - The Intriguing Obsession (和图有关的计数，组合数学)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-codeforces-439-c/</link><pubDate>Wed, 25 Oct 2017 06:31:02 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-25-codeforces-439-c/</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;3个岛屿群，每个岛屿群有若干岛屿。现在要在岛屿之间连桥，桥的长度是1，规定2个属于相同岛屿群的岛屿的距离要大于等于3.&lt;/p&gt;</description></item><item><title>codeforces # 440 div2 E. Points, Lines and Ready-made Titles (和图有关的计数，思维题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-24-codeforces-440-div2-e/</link><pubDate>Tue, 24 Oct 2017 06:39:27 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-24-codeforces-440-div2-e/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/contest/872/problem/E" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：有n个整点，每个点处可以什么都不画，或者画一条垂直方向的直线，或者画一条水平方向的直线。&lt;/p&gt;</description></item><item><title>vimrc for ACM-ICPC (赛场用)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-21-vimrc-for-acm-icpc/</link><pubDate>Sat, 21 Oct 2017 12:54:40 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-21-vimrc-for-acm-icpc/</guid><description>&lt;p&gt;弄了点比较短的，赛场上用的配置文件orz&lt;/p&gt;
&lt;div class="highlight-wrapper"&gt;&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-cpp" data-lang="cpp"&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 1&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;map&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="n"&gt;F5&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="o"&gt;:&lt;/span&gt;&lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;Co&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="n"&gt;CR&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 2&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;func&lt;/span&gt;&lt;span class="o"&gt;!&lt;/span&gt; &lt;span class="n"&gt;Co&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 3&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;exec&lt;/span&gt; &lt;span class="s"&gt;&amp;#34;w&amp;#34;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 4&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;exec&lt;/span&gt; &lt;span class="s"&gt;&amp;#34;!g++ % -std=gnu++11 -Wall -o %&amp;lt;&amp;#34;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 5&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;exec&lt;/span&gt; &lt;span class="s"&gt;&amp;#34;! ./%&amp;lt;&amp;#34;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 6&lt;/span&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 7&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;endfunc&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 8&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;syntax&lt;/span&gt; &lt;span class="n"&gt;on&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt; 9&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;set&lt;/span&gt; &lt;span class="n"&gt;nu&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;10&lt;/span&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;11&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;autocmd&lt;/span&gt; &lt;span class="n"&gt;BufNewFile&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;cpp&lt;/span&gt; &lt;span class="n"&gt;exec&lt;/span&gt; &lt;span class="s"&gt;&amp;#34;:call SetTitle()&amp;#34;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;12&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;func&lt;/span&gt; &lt;span class="n"&gt;SetTitle&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;13&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;14&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;#&lt;/span&gt;&lt;span class="n"&gt;include&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="n"&gt;bits&lt;/span&gt;&lt;span class="o"&gt;/&lt;/span&gt;&lt;span class="n"&gt;stdc&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;h&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;15&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="k"&gt;using&lt;/span&gt; &lt;span class="k"&gt;namespace&lt;/span&gt; &lt;span class="n"&gt;std&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;16&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="k"&gt;const&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;inf&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mh"&gt;0x3f3f3f3f&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;17&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;#&lt;/span&gt;&lt;span class="n"&gt;define&lt;/span&gt; &lt;span class="n"&gt;ms&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="n"&gt;memset&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="k"&gt;sizeof&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;18&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="k"&gt;typedef&lt;/span&gt; &lt;span class="kt"&gt;long&lt;/span&gt; &lt;span class="kt"&gt;long&lt;/span&gt; &lt;span class="n"&gt;LL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;19&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;main&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;20&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;&amp;#39;{&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;21&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;&lt;span class="err"&gt;&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;22&lt;/span&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;let&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;l&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;|&lt;/span&gt; &lt;span class="n"&gt;call&lt;/span&gt; &lt;span class="n"&gt;setline&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;l&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;&amp;#39;}&amp;#39;&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="ln"&gt;23&lt;/span&gt;&lt;span class="cl"&gt;&lt;span class="n"&gt;endfunc&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;/div&gt;
&lt;p&gt;故地重游，rp++&lt;/p&gt;</description></item><item><title>广义Fibonacci数列找循环节 （二次剩余）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-look-for-loop-section-in-generalized-fibonacci-sequence/</link><pubDate>Wed, 18 Oct 2017 05:38:43 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-look-for-loop-section-in-generalized-fibonacci-sequence/</guid><description>&lt;p&gt;**问题：**给定&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://img.blog.csdn.net/20140512141202250"
 &gt;&lt;/figure&gt;

，满足&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://img.blog.csdn.net/20140512141344500"
 &gt;&lt;/figure&gt;

，求&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://img.blog.csdn.net/20140512141547343"
 &gt;&lt;/figure&gt;

的循&lt;/p&gt;
&lt;p&gt;环节长度。&lt;/p&gt;
&lt;p&gt;原理见&lt;a href="http://blog.csdn.net/acdreamers/article/details/25616461" target="_blank" rel="noreferrer"&gt;广义Fibonacci数列找循环节&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;这里只说做法&lt;/p&gt;</description></item><item><title>可持久化线段树学习笔记</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-persistent-segment-tree-notes/</link><pubDate>Wed, 18 Oct 2017 05:12:08 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-persistent-segment-tree-notes/</guid><description>&lt;p&gt;起因是16长春CCPC遇到了一个全场万人过的主席树题目，然而我不会orz，哭哭&lt;/p&gt;</description></item><item><title>2016 CCPC 长春 I 题 | hdu 5919 Sequence II （可持久化线段树求区间第k大+可持久化线段树求区间不同数个数）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-hdu-5919/</link><pubDate>Wed, 18 Oct 2017 04:52:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-hdu-5919/</guid><description>&lt;p&gt;&lt;a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5919" target="_blank" rel="noreferrer"&gt;题目链接&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，有 m次查询，每次查询一个区间[l,r]，求区间中每一种数在区间中第一次出现的位置的中位数，强制在线。&lt;/p&gt;</description></item><item><title>bzoj 1901: Zju2112 Dynamic Rankings (可持久化线段树，区间动态第k大)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-bzoj-1901/</link><pubDate>Mon, 16 Oct 2017 18:38:53 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-bzoj-1901/</guid><description>&lt;h2 class="relative group"&gt;Description
 &lt;div id="description" 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="#description" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;给定一个含有n个数的序列a[1],a[2],a[3]……a[n]，程序必须回答这样的询问：对于给定的i,j,k，在a[i],a[i+1&lt;/p&gt;</description></item></channel></rss>