<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LZX_lzx的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LZX_lzx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LZX_lzx]]></copyright><item><title><![CDATA[2021牛客OI赛前集训营-提高组（第六场）题解]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/126909156</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/126909156</guid><author>LZX_lzx</author><pubDate>Sat, 17 Sep 2022 18:44:29 +0800</pubDate><description><![CDATA[2021牛客OI赛前集训营-提高组（第六场）题解]]></description><category></category></item><item><title><![CDATA[【九省联考 2018】 一双木棋 chess]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/126413177</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/126413177</guid><author>LZX_lzx</author><pubDate>Thu, 18 Aug 2022 20:16:39 +0800</pubDate><description><![CDATA[【九省联考 2018】 一双木棋 chess]]></description><category></category></item><item><title><![CDATA[【2010集训队】书堆]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/125772709</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/125772709</guid><author>LZX_lzx</author><pubDate>Wed, 13 Jul 2022 21:06:05 +0800</pubDate><description><![CDATA[【2010集训队】书堆]]></description><category></category></item><item><title><![CDATA[【COCI 2013】hiperprostor]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/125730877</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/125730877</guid><author>LZX_lzx</author><pubDate>Mon, 11 Jul 2022 21:24:57 +0800</pubDate><description><![CDATA[【COCI 2013】hiperprostor]]></description><category></category></item><item><title><![CDATA[【CEOI 2020】 Roads（道路）]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/125610070</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/125610070</guid><author>LZX_lzx</author><pubDate>Mon, 04 Jul 2022 22:32:29 +0800</pubDate><description><![CDATA[【CEOI 2020】 Roads]]></description><category></category></item><item><title><![CDATA[【COCI 2021-2022#5】Usmjeravanje]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/125573980</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/125573980</guid><author>LZX_lzx</author><pubDate>Sat, 02 Jul 2022 15:58:22 +0800</pubDate><description><![CDATA[【COCI 2021-2022#5】Usmjeravanje]]></description><category></category></item><item><title><![CDATA[【SDOI2017】数字表格]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/124572647</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/124572647</guid><author>LZX_lzx</author><pubDate>Wed, 04 May 2022 16:15:39 +0800</pubDate><description><![CDATA[【SDOI2017】数字表格]]></description><category></category></item><item><title><![CDATA[浅谈 裴蜀定理&扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/124561382</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/124561382</guid><author>LZX_lzx</author><pubDate>Tue, 03 May 2022 20:53:47 +0800</pubDate><description><![CDATA[裴蜀定理&扩展欧几里得]]></description><category></category></item><item><title><![CDATA[最大公约数简谈]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/124557761</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/124557761</guid><author>LZX_lzx</author><pubDate>Tue, 03 May 2022 16:57:33 +0800</pubDate><description><![CDATA[关于求最大公约数的几种方法。]]></description><category></category></item><item><title><![CDATA[【AHOI2006】基因匹配]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/124107417</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/124107417</guid><author>LZX_lzx</author><pubDate>Mon, 11 Apr 2022 20:07:56 +0800</pubDate><description><![CDATA[【AHOI2006】基因匹配]]></description><category></category></item><item><title><![CDATA[【CQOI2009】叶子的染色]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/123939646</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/123939646</guid><author>LZX_lzx</author><pubDate>Sun, 03 Apr 2022 16:27:18 +0800</pubDate><description><![CDATA[【CQOI2009】叶子的染色]]></description><category></category></item><item><title><![CDATA[【NOI Online 2022】普及组题解]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/123855617</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/123855617</guid><author>LZX_lzx</author><pubDate>Fri, 01 Apr 2022 19:31:57 +0800</pubDate><description><![CDATA[【NOI Online 2022】普及组题解。]]></description><category></category></item><item><title><![CDATA[【GDOI2013】大山王国的科举考试]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/123152292</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/123152292</guid><author>LZX_lzx</author><pubDate>Sat, 26 Feb 2022 16:47:18 +0800</pubDate><description><![CDATA[【GDOI2013】大山王国的科举考试]]></description><category></category></item><item><title><![CDATA[【GDOI2014】oj]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/123014354</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/123014354</guid><author>LZX_lzx</author><pubDate>Sat, 19 Feb 2022 09:06:14 +0800</pubDate><description><![CDATA[【GDOI2014】oj]]></description><category></category></item><item><title><![CDATA[【GDKOI2013】琪露诺的完美算法课]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/122888674</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/122888674</guid><author>LZX_lzx</author><pubDate>Fri, 11 Feb 2022 21:11:32 +0800</pubDate><description><![CDATA[【GAKOI2013】琪露诺的完美算法课]]></description><category></category></item><item><title><![CDATA[【GDOI2012】可靠道路网络]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/122848539</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/122848539</guid><author>LZX_lzx</author><pubDate>Wed, 09 Feb 2022 19:45:41 +0800</pubDate><description><![CDATA[【GDOI2012】可靠道路网络]]></description><category></category></item><item><title><![CDATA[【GDOI2008】彩球游戏]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/122628363</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/122628363</guid><author>LZX_lzx</author><pubDate>Fri, 21 Jan 2022 19:56:52 +0800</pubDate><description><![CDATA[【GDOI2008】彩球游戏]]></description><category></category></item><item><title><![CDATA[CF1605A]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/121334085</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/121334085</guid><author>LZX_lzx</author><pubDate>Mon, 15 Nov 2021 14:29:00 +0800</pubDate><description><![CDATA[Solution
由于操作不限次数，那么在总和一定的情况下，a1,a2,a3a_1,a_2,a_3a1​,a2​,a3​ 都可以是任意一个自然数。
此时要让 ∣a1+a3−2×a2∣|a_1+a_3-2\times a_2|∣a1​+a3​−2×a2​∣ 最小，我们可以令 a1=0a_1=0a1​=0，那么就是让 a3=2×a2a_3=2\times a_2a3​=2×a2​，因此 a1+a2+a3a_1+a_2+a_3a1​+a2​+a3​ 如果是 3 的倍数，答案为 0。否则只能让 a3=2×a2+1a]]></description><category></category></item><item><title><![CDATA[CF682D]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/120100283</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/120100283</guid><author>LZX_lzx</author><pubDate>Sat, 04 Sep 2021 15:07:02 +0800</pubDate><description><![CDATA[Solution
比较经典的 dpdpdp​。
考虑 fi,j,kf_{i,j,k}fi,j,k​ 表示 SSS 到了第 iii 位，TTT 到了第 jjj 位，已经选择了 kkk 个子串的最大长度和。
但是由于当前位能否匹配与上一位有关，因此再开一维 0/10/10/1 表示 i−1i-1i−1 和 j−1j-1j−1 是否匹配。
转移：
如果 Si=TjS_i=T_jSi​=Tj​，说明当前位可以匹配，那么 fi,j,k,1=max⁡(fi−1,j−1,k,1,fi−1,j−1,k−1,0)+1f_{i]]></description><category></category></item><item><title><![CDATA[2021“MINIEYE杯”中国大学生算法设计超级联赛（1） 1001 Mod, Or and Everything]]></title><link>https://blog.youkuaiyun.com/LZX_lzx/article/details/118991784</link><guid>https://blog.youkuaiyun.com/LZX_lzx/article/details/118991784</guid><author>LZX_lzx</author><pubDate>Thu, 22 Jul 2021 09:48:11 +0800</pubDate><description><![CDATA[题目大意
给出 nnn，求 (nmod  1)&nbsp;or(nmod  2)&nbsp;or(nmod  3)&nbsp;or…or&nbsp;(nmod  (n−1))&nbsp;or(nmod  n)(n\mod 1)\ or(n\mod2)\ or(n\mod 3)\ or\dots or\ (n\mod (n-1)) \ or(n\mod n)(nmod1)&nbsp;or(nmod2)&nbsp;or(nmod3)&nbsp;or…or&nbsp;(nmod(n−1))&nbsp;or(nmo]]></description><category></category></item></channel></rss>