<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[the_Nickname的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/the_Nickname</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; the_Nickname]]></copyright><item><title><![CDATA[HDU 2546 （01背包）]]></title><link>https://blog.youkuaiyun.com/the_Nickname/article/details/51192535</link><guid>https://blog.youkuaiyun.com/the_Nickname/article/details/51192535</guid><author>the_Nickname</author><pubDate>Tue, 19 Apr 2016 17:39:13 +0800</pubDate><description><![CDATA[Problem Description 
电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。 
某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。 
  既然每种菜只允许]]></description><category></category></item><item><title><![CDATA[HDU 2955 Robberies (01背包)]]></title><link>https://blog.youkuaiyun.com/the_Nickname/article/details/51191966</link><guid>https://blog.youkuaiyun.com/the_Nickname/article/details/51191966</guid><author>the_Nickname</author><pubDate>Tue, 19 Apr 2016 16:47:55 +0800</pubDate><description><![CDATA[题意给出抢劫n个银行各自得到的价值与被捕概率并给出安全概率，求在不被抓的情况下所能获得的最大价值。
   因为题目给出的数据精度问题，所以不能简单的直接将概率作为背包，可将逃跑成功概率（即1-pi）作为价值，n个银行的价值总和作为背包，求逃跑概率大于1-p（安全概率)的项中的最大值。
#include<cstdio>
#include<cstring>
#include<cmath>
#includ]]></description><category></category></item><item><title><![CDATA[poj 2528 线段树数据离散化+区间更新]]></title><link>https://blog.youkuaiyun.com/the_Nickname/article/details/50831972</link><guid>https://blog.youkuaiyun.com/the_Nickname/article/details/50831972</guid><author>the_Nickname</author><pubDate>Wed, 09 Mar 2016 00:29:06 +0800</pubDate><description><![CDATA[POJ2528
 题大意为在一片等高长度为10000000的墙上粘贴n(n<=10000)份海报，在相同区间内后粘贴的海报会覆盖之前海报，求所有操作结束后有多少张海报未被完全覆盖。
 
Sample Input1 
5 
1 4 
2 6 
8 10 
3 4 
7 10Sample Output4因为题目的数据规模较大，直接建立线段树会使用过高的空间并造成极大的空间浪费，所以需要对数据进行离散化处]]></description><category></category></item><item><title><![CDATA[HDU 1728 逃离迷宫 （搜索）]]></title><link>https://blog.youkuaiyun.com/the_Nickname/article/details/47323587</link><guid>https://blog.youkuaiyun.com/the_Nickname/article/details/47323587</guid><author>the_Nickname</author><pubDate>Thu, 06 Aug 2015 21:40:10 +0800</pubDate><description><![CDATA[逃离迷宫
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19550    Accepted Submission(s): 4747


Problem Description
　　给定一个m × n (m行, n列)的迷宫，]]></description><category></category></item><item><title><![CDATA[HDU 3068 最长回文 (manacher算法)]]></title><link>https://blog.youkuaiyun.com/the_Nickname/article/details/47312149</link><guid>https://blog.youkuaiyun.com/the_Nickname/article/details/47312149</guid><author>the_Nickname</author><pubDate>Thu, 06 Aug 2015 10:06:00 +0800</pubDate><description><![CDATA[最长回文
                                      Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
                                                     Total Submission(s]]></description><category></category></item></channel></rss>