<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[渭城朝雨浥轻尘]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/is_cp</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; is_cp]]></copyright><item><title><![CDATA[hdu 1387 Team Queue]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/45111809</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/45111809</guid><author>is_cp</author><pubDate>Sat, 18 Apr 2015 11:27:08 +0800</pubDate><description><![CDATA[Description


Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At ]]></description><category></category></item><item><title><![CDATA[hdu 4006 The kth great number 线段树]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/45032917</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/45032917</guid><author>is_cp</author><pubDate>Mon, 13 Apr 2015 22:06:30 +0800</pubDate><description><![CDATA[Description

Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number writte]]></description><category></category></item><item><title><![CDATA[codeforces 330c]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/45031577</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/45031577</guid><author>is_cp</author><pubDate>Mon, 13 Apr 2015 20:42:50 +0800</pubDate><description><![CDATA[Description

You are an adventurer currently journeying inside an evil temple. After defeating a couple of weak zombies, you arrived at a square room consisting of tiles forming an n × n grid.
 The]]></description><category></category></item><item><title><![CDATA[uva 816Abbott's Revenge]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/44114183</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/44114183</guid><author>is_cp</author><pubDate>Sat, 07 Mar 2015 10:12:39 +0800</pubDate><description><![CDATA[Description







  Abbott’s
 Revenge 





The 1999 World Finals Contest included a problem based on a “dice maze.” At the time the problem was written, the judges were unable to disc]]></description><category></category></item><item><title><![CDATA[uva 514  Rails]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/43493707</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/43493707</guid><author>is_cp</author><pubDate>Wed, 04 Feb 2015 21:08:13 +0800</pubDate><description><![CDATA[﻿﻿
Description


There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time.]]></description><category></category></item><item><title><![CDATA[uva 213 Message Decoding]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/42873771</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/42873771</guid><author>is_cp</author><pubDate>Mon, 19 Jan 2015 15:17:14 +0800</pubDate><description><![CDATA[Description








 Message Decoding 





Some message encoding schemes require that an encoded message be sent in two parts. The first part, called the header, contains the character]]></description><category></category></item><item><title><![CDATA[hdu 4745 Two Rabbits 最长回文子序列]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41511269</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41511269</guid><author>is_cp</author><pubDate>Wed, 26 Nov 2014 09:40:28 +0800</pubDate><description><![CDATA[﻿﻿


Description

Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the ground and the]]></description><category></category></item><item><title><![CDATA[codeforces 268C]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41442133</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41442133</guid><author>is_cp</author><pubDate>Mon, 24 Nov 2014 11:17:08 +0800</pubDate><description><![CDATA[﻿﻿

Manao has invented a new mathematical term — a beautiful set of points. He calls a set of points on a plane beautiful if
 it meets the following conditions:


The coordinates of each point i]]></description><category></category></item><item><title><![CDATA[poj 1141 Brackets Sequence dp]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41382885</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41382885</guid><author>is_cp</author><pubDate>Sat, 22 Nov 2014 16:28:46 +0800</pubDate><description><![CDATA[Description
Let us define a regular brackets sequence in the following way: 

1. Empty sequence is a regular sequence. 
2. If S is a regular sequence, then (S) and [S] are both regular sequenc]]></description><category></category></item><item><title><![CDATA[zoj 3623 Battle Ships dp]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41285913</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41285913</guid><author>is_cp</author><pubDate>Wed, 19 Nov 2014 18:54:54 +0800</pubDate><description><![CDATA[﻿﻿


Description

Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L longevity. The player has a military factory, which can
 ]]></description><category></category></item><item><title><![CDATA[hdu 1172 模拟]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41116053</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41116053</guid><author>is_cp</author><pubDate>Fri, 14 Nov 2014 11:36:11 +0800</pubDate><description><![CDATA[﻿﻿


Description

猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的：计算机随机产生一个四位数，然后玩家猜这个四位数是什么。每猜一个数，计算机都会告诉玩家猜对几个数字，其中有几个数字在正确的位置上。 
比如计算机随机产生的数字为1122。如果玩家猜1234,因为1,2这两个数字同时存在于这两个数中，而且1在这两个数中的位置是相同的，所以计算机会告诉玩家猜对]]></description><category></category></item><item><title><![CDATA[poj 2581 Exact Change Only (dp)]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/41038517</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/41038517</guid><author>is_cp</author><pubDate>Wed, 12 Nov 2014 09:17:12 +0800</pubDate><description><![CDATA[﻿﻿


Description

Boudreaux reached over and shook awake Thibodeaux, who had dozed off somewhere in New Mexico. "Where we at?" Thibodeaux groggily yawned. 

"Not in Vegas, I gua-ran-tee, but co]]></description><category></category></item><item><title><![CDATA[poj 1416 Shredding Company dfs]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/39136517</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/39136517</guid><author>is_cp</author><pubDate>Mon, 08 Sep 2014 14:48:18 +0800</pubDate><description><![CDATA[Description


You have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would just shred sheets of paper into little pieces so that the co]]></description><category></category></item><item><title><![CDATA[hdu 1050 Moving Tables]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38705539</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38705539</guid><author>is_cp</author><pubDate>Wed, 20 Aug 2014 14:11:35 +0800</pubDate><description><![CDATA[Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.

The floor has 200 rooms each on the north side and south side]]></description><category></category></item><item><title><![CDATA[zoj 2027 Travelling Fee]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38656329</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38656329</guid><author>is_cp</author><pubDate>Mon, 18 Aug 2014 10:10:55 +0800</pubDate><description><![CDATA[Description
Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next step is to determine the travel route. As this poor guy has ]]></description><category></category></item><item><title><![CDATA[poj 2570 Fiber Network Floyd]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38639779</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38639779</guid><author>is_cp</author><pubDate>Sun, 17 Aug 2014 16:10:57 +0800</pubDate><description><![CDATA[Description
Several startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many nodes that act as routers all around the world. Unfortunately, t]]></description><category></category></item><item><title><![CDATA[poj  3522 Slim Span]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38579771</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38579771</guid><author>is_cp</author><pubDate>Fri, 15 Aug 2014 08:24:16 +0800</pubDate><description><![CDATA[Description

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.
The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn}
 ]]></description><category></category></item><item><title><![CDATA[hdu 1226 超级密码 bfs]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38566005</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38566005</guid><author>is_cp</author><pubDate>Thu, 14 Aug 2014 22:28:10 +0800</pubDate><description><![CDATA[Description

Ignatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:
密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0

注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门,这种情况也被认]]></description><category></category></item><item><title><![CDATA[hdu 1885 Key Task bfs]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38541789</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38541789</guid><author>is_cp</author><pubDate>Wed, 13 Aug 2014 20:23:04 +0800</pubDate><description><![CDATA[Description

The Czech Technical University is rather old ― you already know that it celebrates 300 years of its existence in 2007. Some of the university buildings are old as well. And the navigati]]></description><category></category></item><item><title><![CDATA[poj 2907 Collecting Beepers dfs]]></title><link>https://blog.youkuaiyun.com/is_cp/article/details/38541523</link><guid>https://blog.youkuaiyun.com/is_cp/article/details/38541523</guid><author>is_cp</author><pubDate>Wed, 13 Aug 2014 20:05:52 +0800</pubDate><description><![CDATA[Description

Karel is a robot who lives in a rectangular coordinate system where each place is designated by a set of integer coordinates (x and y). Your job is to design a program that will help Ka]]></description><category></category></item></channel></rss>