<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet href="/rss-styles.xsl" type="text/xsl"?><rss version="2.0"><channel><title>loli&apos;s OI log</title><description>关于OI学习的记录，记录题解和部分算法上思考</description><link>https://blog.lolifamily.js.org/oi</link><lastBuildDate>Mon, 13 Apr 2026 14:04:17 GMT</lastBuildDate><item><title>solution-code2869</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2869</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2869</guid><description>有顺序的树链剖分模板题，...</description><pubDate>Mon, 20 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><category>树链剖分</category><author>lolifamily</author></item><item><title>常见代码片段</title><link>https://blog.lolifamily.js.org/oi/post/useful-codes</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/useful-codes</guid><description>## 手工栈...</description><pubDate>Mon, 20 Aug 2018 00:00:00 GMT</pubDate><author>lolifamily</author></item><item><title>独木桥</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2260</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2260</guid><description>&gt; 你在桥上看风景，看风景的人在轰炸机上看着你。...</description><pubDate>Tue, 14 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>杂题</category><author>lolifamily</author></item><item><title>[FJOI2007] 轮状病毒</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2422</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2422</guid><description>import bakupLink from &apos;./solution-code2422/bakup.png?url&apos;;...</description><pubDate>Sun, 12 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>FJOI</category><category>2007</category><category>矩阵树</category><category>DP</category><category>差分</category><author>lolifamily</author></item><item><title>[BZOJ3771]Triple</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4705</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4705</guid><description>## 不同情况的生成函数...</description><pubDate>Sun, 12 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>生成函数</category><category>FFT</category><category>NTT</category><author>lolifamily</author></item><item><title>solution-code2593</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2593</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2593</guid><description>## 每种水的生成函数...</description><pubDate>Sat, 11 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>生成函数</category><author>lolifamily</author></item><item><title>solution-code4763</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4763</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4763</guid><description>## 每种食物的生成函数...</description><pubDate>Sat, 11 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>生成函数</category><author>lolifamily</author></item><item><title>[BZOJ3759] Hungergame</title><link>https://blog.lolifamily.js.org/oi/post/solution-code5822</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code5822</guid><description>转载自[joyouth](https://www.cnblogs.com/joyouth/p/5334906.html)...</description><pubDate>Sat, 11 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>线性基</category><category>Nim</category><author>lolifamily</author></item><item><title>生成函数</title><link>https://blog.lolifamily.js.org/oi/post/%E7%94%9F%E6%88%90%E5%87%BD%E6%95%B0</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/%E7%94%9F%E6%88%90%E5%87%BD%E6%95%B0</guid><description>## 注意：...</description><pubDate>Sat, 11 Aug 2018 00:00:00 GMT</pubDate><category>算法</category><category>生成函数</category><author>lolifamily</author></item><item><title>[NOI2008]志愿者招募</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2361</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2361</guid><description>转载自[byvoid](https://www.byvoid.com/zhs/blog/noi-2008-employee)...</description><pubDate>Fri, 10 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>网络流</category><author>lolifamily</author></item><item><title>solution-code4837</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4837</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4837</guid><description>模板题，多注意细节即可...</description><pubDate>Fri, 10 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><category>树链剖分</category><author>lolifamily</author></item><item><title>[luogu4834]萨塔尼亚的期末考试</title><link>https://blog.lolifamily.js.org/oi/post/solution-luogu4834</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-luogu4834</guid><description>这里有 [oeis](https://oeis.org/A014286) 的解释，但是我看不懂。...</description><pubDate>Sun, 05 Aug 2018 00:00:00 GMT</pubDate><category>题解</category><category>Unsolved</category><category>矩阵快速幂</category><author>lolifamily</author></item><item><title>NTT用到的各种素数</title><link>https://blog.lolifamily.js.org/oi/post/ntt-prime</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/ntt-prime</guid><description>转载自 [miskcoo](http://blog.miskcoo.com/2014/07/fft-prime-table)...</description><pubDate>Sat, 04 Aug 2018 00:00:00 GMT</pubDate><category>算法</category><category>数论</category><category>NTT</category><author>lolifamily</author></item><item><title>Educational Codeforces Round 46</title><link>https://blog.lolifamily.js.org/oi/post/compete-cf1000</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/compete-cf1000</guid><description>一场简单题之战，就是比做题的速度以及正确率...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>比赛</category><category>CF</category><author>lolifamily</author></item><item><title>[CodeForces1000]A. Codehorses T-shirts</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000a</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000a</guid><description>一道简单但是题面很难懂的水题，说了半天就是求不同型号的个数...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>Trie树</category><author>lolifamily</author></item><item><title>[CodeForces1000]B. Light It Up</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000b</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000b</guid><description>一道贪心的简单题，插入无非就是两种情况：...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>贪心</category><author>lolifamily</author></item><item><title>[CodeForces1000]C. Covered Points Count</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000c</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000c</guid><description>区间前缀和的经典问题，离散化后求前缀和（值即为覆盖的条数），...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>前缀和</category><author>lolifamily</author></item><item><title>[CodeForces1000]D. Yet Another Problem On a Subsequence</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000d</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000d</guid><description>DP 经典题目，枚举第一个正整数就得到了区间长度，...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>DP</category><author>lolifamily</author></item><item><title>[CodeForces1000]E. We Need More Bosses</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000e</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000e</guid><description>无向图求割边的模板题，缩点后建立新图 DP 一下就可以了。...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>无向图的连通性</category><category>DP</category><author>lolifamily</author></item><item><title>[CodeForces1000]F. One Occurrence</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000f</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000f</guid><description>一道有意思的线段树题目，维护一个 pair 值...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><author>lolifamily</author></item><item><title>[CodeForces1000]G. Two-Paths</title><link>https://blog.lolifamily.js.org/oi/post/solution-cf1000g</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-cf1000g</guid><description>作为压轴题，题目描述很长、很难理解。...</description><pubDate>Thu, 28 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>Unsolved</category><category>LCA</category><author>lolifamily</author></item><item><title>solution-code1433</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1433</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1433</guid><description>模板题，没什么好说的，正着算一遍，反着算一遍，乘积即为答案。...</description><pubDate>Mon, 25 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>树状数组</category><author>lolifamily</author></item><item><title>solution-code2050</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2050</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2050</guid><description>相信大家一眼就看出是二分答案的模板题，...</description><pubDate>Mon, 25 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>二分</category><author>lolifamily</author></item><item><title>[NOIP2003]神经网络</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1065</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1065</guid><description>**一道~~语文题~~**...</description><pubDate>Sun, 24 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>拓扑排序</category><author>lolifamily</author></item><item><title>[luogu1174]打砖块</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2634</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2634</guid><description>注意：子弹没有的时候不能打有奖励的砖块，...</description><pubDate>Sun, 24 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>贪心</category><category>DP</category><author>lolifamily</author></item><item><title>solution-code3192</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3192</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3192</guid><description>把图上的每个点拆成两个点，按照老套路连边，...</description><pubDate>Sun, 24 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>费用流</category><author>lolifamily</author></item><item><title>solution-code3950</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3950</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3950</guid><description>模板题，注意 `a` 数组和 `b` 数组的区别就行了...</description><pubDate>Sun, 24 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>最大流</category><author>lolifamily</author></item><item><title>solution-code4845</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4845</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4845</guid><description>KD 树模板题，注意细节（`mn` 和 `mx` 等）...</description><pubDate>Sun, 24 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>KD树</category><author>lolifamily</author></item><item><title>solution-code1132</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1132</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1132</guid><description>没什么好说的，$O(n)$ 的简单 DP。...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>DP</category><author>lolifamily</author></item><item><title>solution-code1901</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1901</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1901</guid><description>注意优先级！！！`!` 的优先级比 `&amp;` 的优先级高，要打括号。...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>状压DP</category><author>lolifamily</author></item><item><title>solution-code2023</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2023</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2023</guid><description>此题有三个类似的插入操作，可以用一个函数简化代码量。...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>平衡树</category><author>lolifamily</author></item><item><title>solution-code2131</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2131</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2131</guid><description>使用 4-hash 节省判重时间。...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>搜索</category><author>lolifamily</author></item><item><title>solution-code2728</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2728</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2728</guid><description>一道很麻烦的线段树模板题。...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><author>lolifamily</author></item><item><title>solution-code3734</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3734</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3734</guid><description>环形序列：拆环为链，...</description><pubDate>Sat, 23 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><author>lolifamily</author></item><item><title>solution-code2246</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2246</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2246</guid><description>一道很麻烦的平衡树模板题。...</description><pubDate>Fri, 22 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>平衡树</category><author>lolifamily</author></item><item><title>solution-code2660</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2660</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2660</guid><description>线段树模板题，...</description><pubDate>Fri, 22 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>线段树</category><author>lolifamily</author></item><item><title>solution-code3134</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3134</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3134</guid><description>注意：二分起始节点不是 `a+1`，而是 `a+i+1`...</description><pubDate>Fri, 22 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>二分</category><author>lolifamily</author></item><item><title>solution-code3586</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3586</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3586</guid><description>RMQ 模板题，...</description><pubDate>Fri, 22 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>RMQ</category><author>lolifamily</author></item><item><title>solution-code3329</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3329</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3329</guid><description>注意 `n`、`m` 和 `tmp` 的区别！...</description><pubDate>Wed, 20 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>LCA</category><category>DP</category><author>lolifamily</author></item><item><title>solution-code1608</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1608</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1608</guid><description>二叉堆和 RMQ 结合的好题，不停地取 Query 的最大值即可。...</description><pubDate>Mon, 18 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>RMQ</category><category>二叉堆</category><author>lolifamily</author></item><item><title>solution-code4581</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4581</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4581</guid><description>模板题，需要注意 `pos` 和节点名称的区别...</description><pubDate>Mon, 18 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>树链剖分</category><category>线段树</category><author>lolifamily</author></item><item><title>solution-code3179</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3179</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3179</guid><description>一个简单的 Splay 模板题，...</description><pubDate>Sat, 16 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>平衡树</category><author>lolifamily</author></item><item><title>solution-code4469</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4469</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4469</guid><description>模板题，统计更改数目就是求总数目的变化量...</description><pubDate>Sat, 16 Jun 2018 00:00:00 GMT</pubDate><category>题解</category><category>树链剖分</category><category>线段树</category><author>lolifamily</author></item><item><title>solution-code3935</title><link>https://blog.lolifamily.js.org/oi/post/solution-code3935</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code3935</guid><description>题意：给你 $n$ 个插入操作，...</description><pubDate>Sun, 29 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>平衡树</category><category>树状数组</category><author>lolifamily</author></item><item><title>solution-code4575</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4575</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4575</guid><description>树形 DP 模板题，...</description><pubDate>Sun, 29 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>树形DP</category><author>lolifamily</author></item><item><title>树的prufer编码</title><link>https://blog.lolifamily.js.org/oi/post/prufer-encoding</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/prufer-encoding</guid><description>## 注意：...</description><pubDate>Sat, 28 Apr 2018 00:00:00 GMT</pubDate><category>算法</category><category>树的prufer编码</category><author>lolifamily</author></item><item><title>[BZOJ1430]小猴打架</title><link>https://blog.lolifamily.js.org/oi/post/solution-code1826</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code1826</guid><description>树的 prufer 编码的弱版模板题。...</description><pubDate>Sat, 28 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>树的prufer编码</category><author>lolifamily</author></item><item><title>[HNOI2008]明明的烦恼</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2425</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2425</guid><description>详见 :postlink[Prufer编码例题]{id=&quot;oi/prufer-encoding.md&quot; anchor=&quot;题目分析&quot;}...</description><pubDate>Sat, 28 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>树的prufer编码</category><author>lolifamily</author></item><item><title>[HNOI2004]树的计数</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2503</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2503</guid><description>## 注意点：...</description><pubDate>Sat, 28 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>树的prufer编码</category><author>lolifamily</author></item><item><title>最小割树</title><link>https://blog.lolifamily.js.org/oi/post/gomory-hutree</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/gomory-hutree</guid><description>## 注意！...</description><pubDate>Thu, 26 Apr 2018 00:00:00 GMT</pubDate><category>算法</category><category>无向图任意点对最大流</category><author>lolifamily</author></item><item><title>[ZJOI2011]最小割</title><link>https://blog.lolifamily.js.org/oi/post/solution-code2864</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code2864</guid><description>无向图任意点对最大流的模板题，...</description><pubDate>Thu, 26 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>无向图任意点对最大流</category><author>lolifamily</author></item><item><title>[CQOI2016]不同的最小割</title><link>https://blog.lolifamily.js.org/oi/post/solution-code4604</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/solution-code4604</guid><description>无向图任意点对最大流的模板题，...</description><pubDate>Thu, 26 Apr 2018 00:00:00 GMT</pubDate><category>题解</category><category>无向图任意点对最大流</category><author>lolifamily</author></item><item><title>welcome</title><link>https://blog.lolifamily.js.org/oi/post/welcome</link><guid isPermaLink="true">https://blog.lolifamily.js.org/oi/post/welcome</guid><description>此为 OI 分区部分，目前已不从事相关工作，暂时停更。

如果将来有算法相关的问题探讨，此版块可能会继续恢复更新。</description><pubDate>Thu, 26 Apr 2018 00:00:00 GMT</pubDate><author>lolifamily</author></item></channel></rss>