<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Fight_for_NOIP的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Fight_for_NOIP</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Fight_for_NOIP]]></copyright><item><title><![CDATA[【题解】洛谷P6793 [SNOI2020] 字符串]]></title><link>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/115696039</link><guid>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/115696039</guid><author>Fight_for_NOIP</author><pubDate>Wed, 14 Apr 2021 17:57:16 +0800</pubDate><description><![CDATA[SAM 练习好题]]></description><category></category></item><item><title><![CDATA[【题解】洛谷P4168 [Violet]蒲公英 （分块）]]></title><link>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/115418813</link><guid>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/115418813</guid><author>Fight_for_NOIP</author><pubDate>Sun, 04 Apr 2021 17:21:28 +0800</pubDate><description><![CDATA[在线求区间众数。
分块练习好题。]]></description><category></category></item><item><title><![CDATA[【题解】洛谷P3649  [APIO2014] 回文串（SAM）]]></title><link>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/114841660</link><guid>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/114841660</guid><author>Fight_for_NOIP</author><pubDate>Sat, 03 Apr 2021 15:23:56 +0800</pubDate><description><![CDATA[给定一个由小写字母组成的字符串 s。定义 s 的一个子串的存在值为这个子串在 s 中出现的次数乘以这个子串的长度。
对于字符串 s，求所有回文子串中的最大存在值。

SAM练习好题。]]></description><category></category></item><item><title><![CDATA[【学习笔记】FHQ-Treap]]></title><link>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/107547990</link><guid>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/107547990</guid><author>Fight_for_NOIP</author><pubDate>Fri, 24 Jul 2020 16:38:25 +0800</pubDate><description><![CDATA[FHQ-Treap，也称非旋Treap，顾名思义，就是不需要通过旋转，而是通过split和merge维护的Treap。与Treap有点不同，FHQ-Treap能可持久化]]></description><category></category></item><item><title><![CDATA[【题解】[NHOI2018 初中组] [问题 F] 博览会（Exhibition）（树形DP）]]></title><link>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/106816564</link><guid>https://blog.youkuaiyun.com/Fight_for_NOIP/article/details/106816564</guid><author>Fight_for_NOIP</author><pubDate>Sun, 21 Jun 2020 09:46:23 +0800</pubDate><description><![CDATA[博览会有 n 个展馆，每个展馆里有若干个展台。这 n 个展馆以及它们之间的道路可以看成一棵二叉树，博览会的出入口设在根节点—— 1 号展馆，小明将从根节点出发，并最终回到根节点。
由于路程差异，乘坐电瓶车往返不同展馆间的费用也有所区别。出发时，小明的乘车卡里余额为  k。若全程都乘坐电瓶车，他最多能参观多少个展台？

树形DP练习模板题]]></description><category></category></item></channel></rss>