<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[PocketSam的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/PocketSam</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; PocketSam]]></copyright><item><title><![CDATA[XOR Game]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134407322</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134407322</guid><author>PocketSam</author><pubDate>Tue, 14 Nov 2023 20:40:51 +0800</pubDate><description><![CDATA[Trie树 温故知新]]></description><category></category></item><item><title><![CDATA[Cut and Reorder]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134387954</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134387954</guid><author>PocketSam</author><pubDate>Mon, 13 Nov 2023 22:21:01 +0800</pubDate><description><![CDATA[复杂度没算对导致不敢写，分析复杂度时还是多考虑势能，不然错过正解就亏了。转移枚举一段连续的区间即可。操作一可以一开始就做了。]]></description><category></category></item><item><title><![CDATA[Triples of Cows]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134318863</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134318863</guid><author>PocketSam</author><pubDate>Thu, 09 Nov 2023 20:15:50 +0800</pubDate><description><![CDATA[建虚点]]></description><category></category></item><item><title><![CDATA[Bags Game]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134256092</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134256092</guid><author>PocketSam</author><pubDate>Mon, 06 Nov 2023 22:28:47 +0800</pubDate><description><![CDATA[这种博弈问题挺经典的]]></description><category></category></item><item><title><![CDATA[ABC 327]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134251054</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134251054</guid><author>PocketSam</author><pubDate>Mon, 06 Nov 2023 18:43:17 +0800</pubDate><description><![CDATA[AT ABC 327]]></description><category></category></item><item><title><![CDATA[[ABC294Ex] K-Coloring]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134190548</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134190548</guid><author>PocketSam</author><pubDate>Thu, 02 Nov 2023 20:36:38 +0800</pubDate><description><![CDATA[就是一水博客]]></description><category></category></item><item><title><![CDATA[Min +Sum]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134142295</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134142295</guid><author>PocketSam</author><pubDate>Tue, 31 Oct 2023 16:17:31 +0800</pubDate><description><![CDATA[的区间的合法个数. 接下来提到的左端点。用平衡树之类的数据结构维护一下就好了。,那么我们考虑 横跨。区间操作可以多想想分治。若当前分治到的区间为。]]></description><category></category></item><item><title><![CDATA[[NOIP2010 普及组] 三国游戏]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/134020066</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/134020066</guid><author>PocketSam</author><pubDate>Tue, 24 Oct 2023 19:48:44 +0800</pubDate><description><![CDATA[还有一个选择是在选一个不相干的数，产生新的最优搭配，但是无济于事。首先当小涵选了一个数后，一定会产生一个最优搭配和一个次优搭配，明显最优搭配永远取不到，那么他就只能选次优搭配。所以最后一定是取最大的次优搭配。]]></description><category></category></item><item><title><![CDATA[Yet Another mod M]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133999948</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133999948</guid><author>PocketSam</author><pubDate>Mon, 23 Oct 2023 21:57:40 +0800</pubDate><description><![CDATA[虽然这么说有点套路，但还是多这么想想。如果有答案，我们随机一个数。]]></description><category></category></item><item><title><![CDATA[No Monotone Triples]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133755688</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133755688</guid><author>PocketSam</author><pubDate>Tue, 10 Oct 2023 21:23:43 +0800</pubDate><description><![CDATA[Dilworth定理的运用。。]]></description><category></category></item><item><title><![CDATA[[ABC218H] Red and Blue Lamps]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133739825</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133739825</guid><author>PocketSam</author><pubDate>Tue, 10 Oct 2023 10:34:24 +0800</pubDate><description><![CDATA[均为转化后的) ,在计算时避免连续的变色的灯即可。假设初始灯的颜色都相同和变色方案相同，将。盏红灯变成蓝色的结果都是一样的。最优方案变色的灯一定是不连续的。也参考了别人的博客，自己综合了一下。的证明可以考虑反证法，比较显然。是其答案，那么可以明显得知。还是比较简单的，可以看看代码。个位置是否变色的最大值。为需要变色的个数 ，不断用单调队列维护即可。]]></description><category></category></item><item><title><![CDATA[[JSOI2016] 炸弹攻击1]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133563538</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133563538</guid><author>PocketSam</author><pubDate>Wed, 04 Oct 2023 22:38:37 +0800</pubDate><description><![CDATA[SA]]></description><category></category></item><item><title><![CDATA[Jellyfish and Mex]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133563394</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133563394</guid><author>PocketSam</author><pubDate>Wed, 04 Oct 2023 22:34:25 +0800</pubDate><description><![CDATA[按理说，不应该想不出来，我还是太弱了，DP黑洞。2.要删某个数一定是一删到底，直到这个数删完。状态我是真的设计不来，要积累经验呀。]]></description><category></category></item><item><title><![CDATA[状压DP杂题]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133278698</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133278698</guid><author>PocketSam</author><pubDate>Mon, 25 Sep 2023 20:15:38 +0800</pubDate><description><![CDATA[状压压榨我]]></description><category></category></item><item><title><![CDATA[[ABC273G] Row Column Sums 2]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133130009</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133130009</guid><author>PocketSam</author><pubDate>Thu, 21 Sep 2023 12:08:38 +0800</pubDate><description><![CDATA[最后，想想设的状态没有规定每列的和是题目指定的值，只是数量满足了，所以最后要除去排列数。题目中虽然指定了每行和每列的和 ,但其实我们只要求出 有对应 行数和列数的方案数即可。用三维的状态比较好理解转移，改成二维只需去掉。注意代码实现要按之前说的省去第三维。约定：为方便描述，将 “和为。]]></description><category></category></item><item><title><![CDATA[树形DP杂题]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/133044766</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/133044766</guid><author>PocketSam</author><pubDate>Tue, 19 Sep 2023 22:22:06 +0800</pubDate><description><![CDATA[大树，小树，我都要会]]></description><category></category></item><item><title><![CDATA[[ABC118D] Match Matching]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/132996121</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/132996121</guid><author>PocketSam</author><pubDate>Mon, 18 Sep 2023 20:53:54 +0800</pubDate><description><![CDATA[题目的描述很形象，梦回童年，即枚举下一个加入的数。]]></description><category></category></item><item><title><![CDATA[[ABC213G] Connectivity 2]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/132840109</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/132840109</guid><author>PocketSam</author><pubDate>Tue, 12 Sep 2023 21:00:35 +0800</pubDate><description><![CDATA[TXL。]]></description><category></category></item><item><title><![CDATA[[ABC180F] Unbranched]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/132832874</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/132832874</guid><author>PocketSam</author><pubDate>Tue, 12 Sep 2023 15:41:41 +0800</pubDate><description><![CDATA[仔细想想，这个限制翻译过来就是图中每一个连通块是一个。分别讨论加入的新的联通块是链或环的情况即可。个点，构成的图中联通块的大小不超过。的题面大多数情况下都挺人性的。, 不可能是 团 或者 树。的时候限制一下或者装进。对于构造图时特判大小为。所有连通块最多恰好有。]]></description><category></category></item><item><title><![CDATA[The Maximum Prefix]]></title><link>https://blog.youkuaiyun.com/PocketSam/article/details/132811052</link><guid>https://blog.youkuaiyun.com/PocketSam/article/details/132811052</guid><author>PocketSam</author><pubDate>Mon, 11 Sep 2023 16:12:52 +0800</pubDate><description><![CDATA[倒序进行加数的过程，那么当你倒序加入了一个数后。的系数即可，我们用动态规划求出系数即可，转移于。的转移式，就会发现我们可以求出每个。的询问，我们都会单独算一轮；]]></description><category></category></item></channel></rss>