<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Shimmer_的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Shimmer_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Shimmer_]]></copyright><item><title><![CDATA[【dp动态规划总结】]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41555885</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41555885</guid><author>Shimmer_</author><pubDate>Thu, 27 Nov 2014 22:03:30 +0800</pubDate><description><![CDATA[链接 在这 http://www.acmtime.com/?p=31    （宣传新博客用~）]]></description><category></category></item><item><title><![CDATA[HDU 5092 Seam Carving]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41480591</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41480591</guid><author>Shimmer_</author><pubDate>Tue, 25 Nov 2014 13:54:38 +0800</pubDate><description><![CDATA[这个题就是数塔问题。比较简单。 要jil]]></description><category></category></item><item><title><![CDATA[HDU 1176免费馅饼]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41480275</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41480275</guid><author>Shimmer_</author><pubDate>Tue, 25 Nov 2014 13:33:55 +0800</pubDate><description><![CDATA[是一个数塔问题。 没看出来。 


#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
typedef long long L]]></description><category></category></item><item><title><![CDATA[Codeforces Round #279 (Div. 2) B - Queue （简单链表）]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41449645</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41449645</guid><author>Shimmer_</author><pubDate>Mon, 24 Nov 2014 19:16:55 +0800</pubDate><description><![CDATA[这个题不错。 是一个简单的思路题。 不过自己]]></description><category></category></item><item><title><![CDATA[Codeforces Round #279 (Div. 2) C. Hacking Cypher]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41449345</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41449345</guid><author>Shimmer_</author><pubDate>Mon, 24 Nov 2014 19:07:27 +0800</pubDate><description><![CDATA[没做出三个题。 掉分了。 坑]]></description><category></category></item><item><title><![CDATA[HDU 1074 Doing Homework（状态压缩）]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41411507</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41411507</guid><author>Shimmer_</author><pubDate>Sun, 23 Nov 2014 15:47:14 +0800</pubDate><description><![CDATA[作业的先后顺序问题、  一看最多只有15次作业。]]></description><category></category></item><item><title><![CDATA[HDU 1080 Human Gene Functions]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41351795</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41351795</guid><author>Shimmer_</author><pubDate>Fri, 21 Nov 2014 17:24:32 +0800</pubDate><description><![CDATA[读完这个题 一直以为添加空格 使得两个字符串一样长。 然后求最大]]></description><category></category></item><item><title><![CDATA[HDU 1059 Dividing(多重背包)]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41348451</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41348451</guid><author>Shimmer_</author><pubDate>Fri, 21 Nov 2014 14:20:47 +0800</pubDate><description><![CDATA[多重背包判断 sum 为偶数的时候 sum/2 可达不可达。


还是很简单的。  只要sum/2  那么 sum 一定key]]></description><category></category></item><item><title><![CDATA[HDU 1158 Employment Planning]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41320999</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41320999</guid><author>Shimmer_</author><pubDate>Thu, 20 Nov 2014 21:10:13 +0800</pubDate><description><![CDATA[HDU上的这个破题太恶心了。


数据都不给]]></description><category></category></item><item><title><![CDATA[HDU 2059 龟兔赛跑]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41315713</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41315713</guid><author>Shimmer_</author><pubDate>Thu, 20 Nov 2014 16:48:02 +0800</pubDate><description><![CDATA[这个dp 实在是秒。  起初自己的设想是  d【i】  来biaosh]]></description><category></category></item><item><title><![CDATA[HDU 1078 FatMouse and Cheese]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41311087</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41311087</guid><author>Shimmer_</author><pubDate>Thu, 20 Nov 2014 12:42:48 +0800</pubDate><description><![CDATA[这个题也很简单。 记忆化搜锁。 对于某一个点的最大值肯定是周围点去取一个zuid]]></description><category></category></item><item><title><![CDATA[HDU 1025 Constructing Roads In JGShining's Kingdom]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41285267</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41285267</guid><author>Shimmer_</author><pubDate>Wed, 19 Nov 2014 17:55:42 +0800</pubDate><description><![CDATA[这个题很明显了。]]></description><category></category></item><item><title><![CDATA[HDU 1160 FatMouse's Speed]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41284625</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41284625</guid><author>Shimmer_</author><pubDate>Wed, 19 Nov 2014 17:13:25 +0800</pubDate><description><![CDATA[水dp啊。


一维数组搞定]]></description><category></category></item><item><title><![CDATA[HDU 1024 Max Sum Plus Plus]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41251173</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41251173</guid><author>Shimmer_</author><pubDate>Tue, 18 Nov 2014 18:58:22 +0800</pubDate><description><![CDATA[这个题就是求最大的字段和， 输入 m， 求一个序列 不相交的m段的最大和。


和 最大连续喝]]></description><category></category></item><item><title><![CDATA[Codeforces Round #277.5 (Div. 2) D. Unbearable Controversy of Being]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41244417</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41244417</guid><author>Shimmer_</author><pubDate>Tue, 18 Nov 2014 11:30:49 +0800</pubDate><description><![CDATA[这个题明显自己把自己给恶心到了。]]></description><category></category></item><item><title><![CDATA[ZOJ 3802  Easy 2048 Again（压缩dp）]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41176543</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41176543</guid><author>Shimmer_</author><pubDate>Sun, 16 Nov 2014 20:32:03 +0800</pubDate><description><![CDATA[我的dp水平还想不透 压缩dp 更不用说 做出来了。


对于这个题。 还]]></description><category></category></item><item><title><![CDATA[ZOJ 3806 Incircle and Circumcircle]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41173527</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41173527</guid><author>Shimmer_</author><pubDate>Sun, 16 Nov 2014 16:06:40 +0800</pubDate><description><![CDATA[又是计算几何的二分题。]]></description><category></category></item><item><title><![CDATA[HDU 2191 珍惜现在，感恩生活]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41122277</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41122277</guid><author>Shimmer_</author><pubDate>Fri, 14 Nov 2014 19:04:13 +0800</pubDate><description><![CDATA[多重背包。 


超过总价钱的是完全背包。 少于总价钱的 用 二进制优化然后按照0 1背包做。


用 d【i】 = j 表示 当价钱为 i 时 做多有多重的米。


具体实现代码。


#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#inc]]></description><category></category></item><item><title><![CDATA[HDU 1789 Doing Homework again（经典贪心）]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41120679</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41120679</guid><author>Shimmer_</author><pubDate>Fri, 14 Nov 2014 16:43:06 +0800</pubDate><description><![CDATA[贪心题。 因为一门作业完成时间都是一天。 所以扣分多的自然要先完成。]]></description><category></category></item><item><title><![CDATA[HDU 4991 Ordered Subsequence（dp+树状数组）]]></title><link>https://blog.youkuaiyun.com/Shimmer_/article/details/41090187</link><guid>https://blog.youkuaiyun.com/Shimmer_/article/details/41090187</guid><author>Shimmer_</author><pubDate>Thu, 13 Nov 2014 22:17:38 +0800</pubDate><description><![CDATA[好题啊。  自己想的dp。


dp【i】【j】 代表第i个数时  连xu]]></description><category></category></item></channel></rss>