<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[WAR___NING的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/WAR___NING</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; WAR___NING]]></copyright><item><title><![CDATA[HDU1015Safecracker——水题]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/48382313</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/48382313</guid><author>WAR___NING</author><pubDate>Fri, 11 Sep 2015 23:39:13 +0800</pubDate><description><![CDATA[=== Op tech briefing, 2002/11/02 06:42 CST === 
"The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fortunately o]]></description><category></category></item><item><title><![CDATA[uva103Stacking Boxes——dp]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47982917</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47982917</guid><author>WAR___NING</author><pubDate>Tue, 25 Aug 2015 20:30:09 +0800</pubDate><description><![CDATA[Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider solving differential equations in several dimensions and analyzing the topology of an n-dimensiona]]></description><category></category></item><item><title><![CDATA[UVA111History Grading——dp]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47982821</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47982821</guid><author>WAR___NING</author><pubDate>Tue, 25 Aug 2015 20:27:17 +0800</pubDate><description><![CDATA[Many problems in Computer Science involve maximizing some measure according to constraints.
Consider a history exam in which students are asked to put several historical events into chronological order. Students who order all the events correctly will rece]]></description><category></category></item><item><title><![CDATA[UVA10131Is Bigger Smarter?——dp动态转移方程]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47977353</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47977353</guid><author>WAR___NING</author><pubDate>Tue, 25 Aug 2015 15:05:49 +0800</pubDate><description><![CDATA[Some people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take
the data on a collection of elephants and put as large a subset of this data as possible into a sequence
so that the weights are increasing, but the IQ’]]></description><category></category></item><item><title><![CDATA[强连通即模板题HDU269]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47976915</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47976915</guid><author>WAR___NING</author><pubDate>Tue, 25 Aug 2015 14:49:59 +0800</pubDate><description><![CDATA[为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和M条通道(M<=100000)，每个通道都是单向的，就是说若称某通道连通了A房间和B房间，只说明可以通过这个通道由A房间到达B房间，但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的，即：对于任意的i和j，至少存在一条路径可以从房间i到房间j，也存在一条路径可以从房间j到房间i。]]></description><category></category></item><item><title><![CDATA[HDU1142——A Walk Through the Forest（spfa+记忆化搜索）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47169559</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47169559</guid><author>WAR___NING</author><pubDate>Fri, 31 Jul 2015 14:24:14 +0800</pubDate><description><![CDATA[Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A]]></description><category></category></item><item><title><![CDATA[HDU2124——Repair the Wall（贪心水题）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47109025</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47109025</guid><author>WAR___NING</author><pubDate>Tue, 28 Jul 2015 17:53:42 +0800</pubDate><description><![CDATA[Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.

When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what mad]]></description><category></category></item><item><title><![CDATA[HDU2111——Saving HDU（贪心）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47106415</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47106415</guid><author>WAR___NING</author><pubDate>Tue, 28 Jul 2015 15:51:02 +0800</pubDate><description><![CDATA[话说上回讲到海东集团面临内外交困，公司的元老也只剩下XHD夫妇二人了。显然，作为多年拼搏的商人，XHD不会坐以待毙的。
  一天，当他正在苦思冥想解困良策的时候，突然想到了自己的传家宝，那是公司成立的时候，父亲作为贺礼送来的一个锦囊，徐父当时交代，不到万不得已的时候，不要打开它。“现在不正是最需要的时候吗？”，一边想，XHD一边找到了这个精心保管的锦囊，打开一看，里面只有一句话“杭城北麓千人洞有宝”。
  二话不说，XHD拿起一个大口袋就出发了，这个千人洞他是知道的，小的时候，爸爸曾经带他来过这个隐蔽的路口]]></description><category></category></item><item><title><![CDATA[HDU1050——Moving Tables（贪心）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47105031</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47105031</guid><author>WAR___NING</author><pubDate>Tue, 28 Jul 2015 14:40:49 +0800</pubDate><description><![CDATA[The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, on]]></description><category></category></item><item><title><![CDATA[HDU1052——田忌赛马（贪心）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47088585</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47088585</guid><author>WAR___NING</author><pubDate>Mon, 27 Jul 2015 18:05:58 +0800</pubDate><description><![CDATA[Here is a famous story in Chinese history.

"That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."

"Both of Tian and the king have three horses in different classes, ]]></description><category></category></item><item><title><![CDATA[HDU1058——Humble Numbers]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47057161</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47057161</guid><author>WAR___NING</author><pubDate>Sat, 25 Jul 2015 15:55:26 +0800</pubDate><description><![CDATA[A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers. 

Write a program to find and print the nth element in th]]></description><category></category></item><item><title><![CDATA[HDU1257——最少拦截系统（贪心）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47035511</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47035511</guid><author>WAR___NING</author><pubDate>Fri, 24 Jul 2015 09:07:43 +0800</pubDate><description><![CDATA[某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.
怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系统]]></description><category></category></item><item><title><![CDATA[HDU1800——Flying to the Mars（map+贪心）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47018255</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47018255</guid><author>WAR___NING</author><pubDate>Thu, 23 Jul 2015 10:30:36 +0800</pubDate><description><![CDATA[In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who ruling the Mars . Here the problem comes! How can the soldiers reach the Mars ?]]></description><category></category></item><item><title><![CDATA[区间覆盖，选点]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/47005225</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/47005225</guid><author>WAR___NING</author><pubDate>Wed, 22 Jul 2015 16:18:25 +0800</pubDate><description><![CDATA[1）区间完全覆盖问题

问题描述：给定一个长度为m的区间，再给出n条线段的起点和终点（注意这里是闭区间），求最少使用多少条线段可以将整个区间完全覆盖

样例：

区间长度8，可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5]

解题过程:

1将每一个区间按照左端点递增顺序排列，拍完序后为[1,4]，[2,4]，[2,6]，[3,5]]></description><category></category></item><item><title><![CDATA[HDu1116——Play on Words（并查集+欧拉路径）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46999875</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46999875</guid><author>WAR___NING</author><pubDate>Wed, 22 Jul 2015 10:44:14 +0800</pubDate><description><![CDATA[Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important for us. 

There is a large number of magnetic plat]]></description><category></category></item><item><title><![CDATA[hdu1217——Arbitrage（flody）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46989305</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46989305</guid><author>WAR___NING</author><pubDate>Tue, 21 Jul 2015 17:30:35 +0800</pubDate><description><![CDATA[Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, and 1 ]]></description><category></category></item><item><title><![CDATA[HDU2112——HDU Today（map容器+spfa）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46985551</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46985551</guid><author>WAR___NING</author><pubDate>Tue, 21 Jul 2015 14:22:29 +0800</pubDate><description><![CDATA[经过锦囊相助，海东集团终于度过了危机，从此，HDU的发展就一直顺风顺水，到了2050年，集团已经相当规模了，据说进入了钱江肉丝经济开发区500强。这时候，XHD夫妇也退居了二线，并在风景秀美的诸暨市浬浦镇陶姚村买了个房子，开始安度晚年了。
这样住了一段时间，徐总对当地的交通还是不太了解。有时很郁闷，想去一个地方又不知道应该乘什么公交车，在什么地方转车，在什么地方下车（其实徐总自己有车，却一定要与民同乐，这就是徐总的性格）。
徐总经常会问蹩脚的英文问路：“Can you help me?”。看着他那迷茫而又无]]></description><category></category></item><item><title><![CDATA[HDU3790——最短路径问题（spfa）]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46980977</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46980977</guid><author>WAR___NING</author><pubDate>Tue, 21 Jul 2015 09:26:42 +0800</pubDate><description><![CDATA[给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。]]></description><category></category></item><item><title><![CDATA[ACM之路的高一下学期]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46730623</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46730623</guid><author>WAR___NING</author><pubDate>Thu, 02 Jul 2015 20:15:09 +0800</pubDate><description><![CDATA[期末来临，实验室给我们放假方便大家复习这学期的知识应对考试。
在这之前，经过好几天的考试，实验室T掉了一部分人，很少但是很幸运不包括我，虽然暂时留在实验室了，但是我还能走多久我真的不知道，这学期的暑假培训真的至关重要，如果学不好，下学期可能被大一的虐，后果不堪设想啊。
这几天我考虑明白一件事，之前为了实验室感觉放弃了做其他事情的时间，但是在实验室的回报却没有那么多，仔细想了一想，那些时间我也并]]></description><category></category></item><item><title><![CDATA[hdu2544最短路——Dijkstra]]></title><link>https://blog.youkuaiyun.com/WAR___NING/article/details/46575251</link><guid>https://blog.youkuaiyun.com/WAR___NING/article/details/46575251</guid><author>WAR___NING</author><pubDate>Sat, 20 Jun 2015 19:47:53 +0800</pubDate><description><![CDATA[模板题]]></description><category></category></item></channel></rss>