<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lyhypacm</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lyhypacm]]></copyright><item><title><![CDATA[UVA11990 ``Dynamic'' Inversion 树套树]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6838356</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6838356</guid><author>lyhypacm</author><pubDate>Fri, 30 Sep 2011 20:31:49 +0800</pubDate><description><![CDATA[这题很经典的动态逆序对问题，我们可以利用树套树来解决它，首先我们得到一个总体的思路
对于每一个操作，我们先利用树状数组求出一个逆序对，然后进行查询统计，对于每一个删除操作，我们只要查询这个元素之前的比它大的还有后面的比它小的有多少，逆序对就减少多少，这个操作可以利用树套树搞定]]></description><category></category></item><item><title><![CDATA[ZOJ2011-Dynamic Rankings 树套树？]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6838248</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6838248</guid><author>lyhypacm</author><pubDate>Fri, 30 Sep 2011 18:56:20 +0800</pubDate><description><![CDATA[好久没有写博文了，这题是刚才被lrj的题虐了之后写的，这题的题意是告诉你N个数的序列，每次修改一个位置的值，动态查询区间第k个元素


做法是维护一个线段树，这样我们就可以得到区间的信息，但是这时候我们并不能维护区间有序的序列，所以我们要二分答案，查询l到r区间内比这个数小]]></description><category></category></item><item><title><![CDATA[ZOJ3533-Gao the String I]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6791416</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6791416</guid><author>lyhypacm</author><pubDate>Mon, 19 Sep 2011 20:33:56 +0800</pubDate><description><![CDATA[好吧，这场比赛被完虐，3+3来的太不容易了，这题在之前见过类似的问题，不过那题至今没过，还是处于TLE的状态- -
题号是UVA11996，感兴趣的孩子可以去写写
这题的主要思路是利用splay维护序列，对于reverse和modify操作都可以直接利用splay来维护，主要]]></description><category></category></item><item><title><![CDATA[树形结构转线性结构的方法(帖子汇总)]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6734748</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6734748</guid><author>lyhypacm</author><pubDate>Wed, 31 Aug 2011 10:03:07 +0800</pubDate><description><![CDATA[在图论中经常遇到一些很常见的问题，比如一个非常简单的例子，给你一棵树，每一个点都有一个权值，现在动态更新一个点的权值，叫你查询一个点对路径上所有点权的和，这种问题和图论的Tree  Problem非常类似，我们可以利用树形结构转线性结构的方法来处理，我们考虑随便取一个点，比如说1]]></description><category></category></item><item><title><![CDATA[HDU3957 Dancing Links]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6700816</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6700816</guid><author>lyhypacm</author><pubDate>Fri, 19 Aug 2011 10:56:34 +0800</pubDate><description><![CDATA[好吧，昨天被这题虐惨了，照着模板敲漏了一句话，导致1005没有时间写了。这题可以算是一个比较经典的Dancing Links的题了，我们将问题抽象这如下一个模型。

给你一个R*C的0-1矩阵，要求选出最小数量的行使得每一列至少被覆盖一次，并且有限制某一些行中只能至多选择一行]]></description><category></category></item><item><title><![CDATA[HDU3957 Dancing Links]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6700742</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6700742</guid><author>lyhypacm</author><pubDate>Fri, 19 Aug 2011 10:42:05 +0800</pubDate><description><![CDATA[好吧，昨天被这题虐惨了，照着模板敲漏了一句话，导致1005没有时间写了。这题可以算是一个比较经典的Dancing Links的题了，我们将问题抽象这如下一个模型。
给你一个R*C的0-1矩阵，要求选出最小数量的行使得每一列至少被覆盖一次，并且有限制某一些行中只能至多选择一行。]]></description><category></category></item><item><title><![CDATA[2011-07-31 阶段性总结]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6648302</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6648302</guid><author>lyhypacm</author><pubDate>Sun, 31 Jul 2011 14:23:00 +0800</pubDate><description><![CDATA[这个blog好久没有上来看了，看到原来写的一些文章，发现现在的代码风格完全变了个样儿，大半年没有写博文了，主要还是比较忙的原因，现在发现对于一些题目的理解，不能只局限于对某一题的做法的理解，要把相似问题转化为模型，这样我们才能在比赛中获得比较好的成绩。


这半年可以说自己]]></description><category></category></item><item><title><![CDATA[splay经典题目举例]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6630582</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6630582</guid><author>lyhypacm</author><pubDate>Mon, 25 Jul 2011 04:15:53 +0800</pubDate><description><![CDATA[数据结构专攻告一段落吧，把这段时间和以前做过的splay的题目拿出来晒晒，没题都写了一下简单的解题报告，用白色的字体，每道题的做法最好要多花时间琢磨琢磨，splay的题目主要就是中间过程的处理上比较麻烦。为了方便，我对区间操作都是将l-1结点splay到根，r+1结点splay到]]></description><category></category></item><item><title><![CDATA[HDU1244最大连续子字段和最终加强版]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6082146</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6082146</guid><author>lyhypacm</author><pubDate>Fri, 17 Dec 2010 14:15:00 +0800</pubDate><description><![CDATA[dp优化]]></description><category></category></item><item><title><![CDATA[POJ2373动态规划]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6064833</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6064833</guid><author>lyhypacm</author><pubDate>Thu, 09 Dec 2010 10:35:00 +0800</pubDate><description><![CDATA[单调队列优化的dp]]></description><category></category></item><item><title><![CDATA[POJ3250从多个方面考虑同一问题]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6061824</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6061824</guid><author>lyhypacm</author><pubDate>Tue, 07 Dec 2010 22:26:00 +0800</pubDate><description><![CDATA[多解题]]></description><category></category></item><item><title><![CDATA[POJ1742多重背包]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6060806</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6060806</guid><author>lyhypacm</author><pubDate>Tue, 07 Dec 2010 15:27:00 +0800</pubDate><description><![CDATA[单调队列优化的背包问题，在O(NV)的复杂度里完成多重背包。
]]></description><category></category></item><item><title><![CDATA[HDU3415单调队列]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6059309</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6059309</guid><author>lyhypacm</author><pubDate>Mon, 06 Dec 2010 21:08:00 +0800</pubDate><description><![CDATA[单调队列]]></description><category></category></item><item><title><![CDATA[CDOJ1300 LCIS]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6053609</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6053609</guid><author>lyhypacm</author><pubDate>Fri, 03 Dec 2010 18:58:00 +0800</pubDate><description><![CDATA[动态规划经典问题——最长公共上升子序列]]></description><category></category></item><item><title><![CDATA[HDU1506线段树做法]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6049739</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6049739</guid><author>lyhypacm</author><pubDate>Thu, 02 Dec 2010 12:33:00 +0800</pubDate><description><![CDATA[线段树经典变形之一]]></description><category></category></item><item><title><![CDATA[HDU2955 动态规划一维状态一维转移]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6049235</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6049235</guid><author>lyhypacm</author><pubDate>Thu, 02 Dec 2010 09:24:00 +0800</pubDate><description><![CDATA[dp背包变形。。。]]></description><category></category></item><item><title><![CDATA[HDU3491 网络流最小割模型]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6038800</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6038800</guid><author>lyhypacm</author><pubDate>Sat, 27 Nov 2010 09:48:00 +0800</pubDate><description><![CDATA[最大流最小割模型]]></description><category></category></item><item><title><![CDATA[POJ1459 多源多汇网络流经典模型]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6038357</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6038357</guid><author>lyhypacm</author><pubDate>Fri, 26 Nov 2010 21:50:00 +0800</pubDate><description><![CDATA[多源多汇网络流模型]]></description><category></category></item><item><title><![CDATA[POJ3081 网络流]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6038249</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6038249</guid><author>lyhypacm</author><pubDate>Fri, 26 Nov 2010 20:43:00 +0800</pubDate><description><![CDATA[网络流建图]]></description><category></category></item><item><title><![CDATA[HDU1880 字符串hash]]></title><link>https://blog.youkuaiyun.com/lyhypacm/article/details/6034434</link><guid>https://blog.youkuaiyun.com/lyhypacm/article/details/6034434</guid><author>lyhypacm</author><pubDate>Thu, 25 Nov 2010 12:38:00 +0800</pubDate><description><![CDATA[字符串hash]]></description><category></category></item></channel></rss>