<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ruin]]></title><description><![CDATA[遗弃之地]]></description><link>https://blog.youkuaiyun.com/Coder_Number233</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Coder_Number233]]></copyright><item><title><![CDATA[[NOIP TG]来自一个打崩的分数比得的分数都高的蒟蒻的怨念]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/78638907</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/78638907</guid><author>Coder_Number233</author><pubDate>Sun, 26 Nov 2017 19:24:02 +0800</pubDate><description><![CDATA[（dalao说标题一定要长长长长长长长长长）]]></description><category></category></item><item><title><![CDATA[【NOIP2016TG D1T3】换教室解题报告]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/78075950</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/78075950</guid><author>Coder_Number233</author><pubDate>Sun, 24 Sep 2017 11:44:14 +0800</pubDate><description><![CDATA[本来几个月前就想做这道题就学了期望，结果那天死活调不出来之后就忘了这件事了……然后rty dalao今天想起做这道题来了我想起来这事就又把这个题拿了出来调了一上午调出来了，谁知道错竟然在预处理上……]]></description><category></category></item><item><title><![CDATA[[NOIP1999]导弹拦截NlogN做法]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/78030778</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/78030778</guid><author>Coder_Number233</author><pubDate>Tue, 19 Sep 2017 15:42:05 +0800</pubDate><description><![CDATA[导弹拦截是一道经典的DP题，当时的数据使得N^2做法完全能够AC这道题。 
然而对于这种最长不上升、或不下降、或严格上升、或严格下降的子序列长度求解问题都有一个非常实用的NlogN的做法，这种做法因为使用了二分查找，所以将N的复杂度降低到了logN。]]></description><category></category></item><item><title><![CDATA[[树形DP入门]没有上司的舞会]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/78011791</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/78011791</guid><author>Coder_Number233</author><pubDate>Sun, 17 Sep 2017 17:29:35 +0800</pubDate><description><![CDATA[嗯博主作为一个蒟蒻半年忘了验证手机然后……就登不上号了QAQ 
趁大休回去博主验证完了可算是能登录了orz]]></description><category></category></item><item><title><![CDATA[[Tarjan算法]最近公共祖先(LCA)问题求解]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/55224312</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/55224312</guid><author>Coder_Number233</author><pubDate>Wed, 15 Feb 2017 21:44:00 +0800</pubDate><description><![CDATA[想了一想几个月前打的用于解LCA的Tarjan貌似弃坑就没再管它，然后虚拟机磁盘被我莫名其妙起爆了以后之前打的程序全都打了水漂就想起了被置之不理的Tarjan解LCA问题的板子，索性就把坑填上呗，毕竟我不是挖坑不填的主（明明还有一堆乱七八糟的平衡树没填 ）]]></description><category></category></item><item><title><![CDATA[矩(方)阵运算]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/54949257</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/54949257</guid><author>Coder_Number233</author><pubDate>Thu, 09 Feb 2017 17:11:03 +0800</pubDate><description><![CDATA[打完一个矩阵快速幂的板子以后心血来潮写了个namespace……不过因为是快速幂的板子所以也就能支持长宽一致的矩阵之间的运算，别的之后再改吧… 
这篇Blog可能随时就会改掉，毕竟之后还要往里面塞一些乱七八糟的东西什么的，比如至少先支持真正的矩阵之间的加减乘运算的说…]]></description><category></category></item><item><title><![CDATA[模板：线段树]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/53510046</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/53510046</guid><author>Coder_Number233</author><pubDate>Wed, 07 Dec 2016 20:17:23 +0800</pubDate><description><![CDATA[线段树笔记]]></description><category></category></item><item><title><![CDATA[Rabin-Karp 字符串匹配算法]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/53490238</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/53490238</guid><author>Coder_Number233</author><pubDate>Tue, 06 Dec 2016 17:50:15 +0800</pubDate><description><![CDATA[复赛比完了就继续研究些算法呗，然后觉得自己字符串匹配还不会，就去啃了啃算法导论，觉得Rabin-Karp挺有意思的就写篇Blog记录一下。]]></description><category></category></item><item><title><![CDATA[【USACO】Roadblock路障  解题报告]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/53186114</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/53186114</guid><author>Coder_Number233</author><pubDate>Wed, 16 Nov 2016 14:23:06 +0800</pubDate><description><![CDATA[上午学校里组织测试碰到了这道题于是兴趣一起写了这篇Blog。]]></description><category></category></item><item><title><![CDATA[【NOIP2015TG D1T3】斗地主]]></title><link>https://blog.youkuaiyun.com/Coder_Number233/article/details/53175780</link><guid>https://blog.youkuaiyun.com/Coder_Number233/article/details/53175780</guid><author>Coder_Number233</author><pubDate>Tue, 15 Nov 2016 19:40:03 +0800</pubDate><description><![CDATA[第一篇Blog交给一道大搜索……作为NOIP2015Day1的最后一题斗地主并不难想出做法，但是写起来太麻烦了……很多人一看见题目就失去了做这道题的勇气，其实这个题本身还是挺好写的，只是代码相对长许多就是了。]]></description><category></category></item></channel></rss>