2013年07月_键盘上的舞者

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 POJ2955：Brackets(区间DP)

DescriptionWe give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence, if s is a regular brackets sequence, then (s) and [s]

2013-07-31 21:40:34 4145

原创 HDU4521：小明系列问题——小明序列(LIS加强版)

Problem Description　　大家都知道小明最喜欢研究跟序列有关的问题了，可是也就因为这样，小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题，可是找来找去都是自己早已研究过的序列。小明想既然找不到，那就自己来发明一个新的序列问题吧！小明想啊想，终于想出了一个新的序列问题，他欣喜若狂，因为是自己想出来的，于是将其新序列问题命名为“小明序列”。　　

2013-07-31 11:37:01 3117

原创 HDU1950：Bridging signals(LIS)

Problem Description'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip

2013-07-30 22:09:30 2711

原创 POJ3903：Stock Exchange(LIS)

DescriptionThe world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exch

2013-07-30 21:51:55 2909

原创 HDU1025：Constructing Roads In JGShining's Kingdom(LIS)

Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich

2013-07-30 17:18:31 2262

原创 HDU4512：吉哥系列故事——完美队形I(LICS)

Problem Description　　吉哥这几天对队形比较感兴趣。　　有一天，有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则称之为完美队形：　　　　1、挑出的人保持他们在原队形的相对顺序不变；　　2、左右对称，假设有m个人形成新的队形，则第1个人和第m个人身

2013-07-30 16:22:27 2232

原创 POJ2250：Compromise(LCS)

DescriptionIn a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (

2013-07-30 14:55:22 2955 1

原创 HDU1257：最少拦截系统(LIS)

Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求

2013-07-30 13:56:39 1604

原创 POJ2127:Greatest Common Increasing Subsequence(LICS)

DescriptionYou are given two sequences of integer numbers. Write a program to determine their common increasing subsequence of maximal possible length.Sequence S1 , S2 , . . . , SN of length N i

2013-07-30 10:02:25 1882

原创 HDU1423：Greatest Common Increasing Subsequence(LICS)

Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is described with M - its length (1 Output

2013-07-29 22:14:24 2033

原创 POJ2533：Longest Ordered Subsequence(LIS)

DescriptionA numeric sequence of ai is ordered ifa1 a2 aN. Let the subsequence of the given numeric sequence (a1,a2, ..., aN) be any sequence (ai1,ai2, ..., aiK), where 1 <=i1 i2 iK <=N. F

2013-07-29 20:50:53 5596

原创 HDU1513 &&　POJ1159：Palindrome(LCS)

Problem DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determ

2013-07-29 18:16:04 2831 1

原创 HDU1503:Advanced Fruits(LCS)

Problem DescriptionThe company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn

2013-07-29 17:17:33 5754 2

原创 HDU1159 && POJ1458：Common Subsequence(LCS)

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exi

2013-07-29 16:04:56 1725

原创 HDU4414：Finding crosses

Problem DescriptionThe Nazca Lines are a series of ancient geoglyphs located in the Nazca Desert in southern Peru. They were designated as a UNESCO World Heritage Site in 1994. The high, arid platea

2013-07-28 20:51:27 1461

原创 HDU3328 && POJ3824：Flipper

Problem DescriptionLittle Bobby Roberts (son of Big Bob, of Problem G) plays this solitaire memory game called Flipper. He starts with n cards, numbered 1 through n, and lays them out in a row wit

2013-07-28 20:45:56 1800

原创 HDU1443 && POJ1012：Joseph

Problem DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is

2013-07-28 20:32:31 1949

原创 HDU1412：{A} + {B}

Problem Description给你两个集合，要求{A} + {B}.注:同一个集合中不会有两个相同的元素. Input每组输入数据分为三行,第一行有两个数字n,m(0 Output针对每组数据输出一行数据,表示合并后的集合,要求从小到大输出,每个元素之间有一个空格隔开. Sample Input1 212 31 2

2013-07-28 20:24:39 2381 2

原创 ZOJ3708:Density of Power Network

The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In real world, the

2013-07-28 20:19:04 2918

原创 ZOJ3714：Java Beans

There are N little kids sitting in a circle, each of them are carrying some java beans in their hand. Their teacher want to select M kids who seated in M consecutive seats and collect java beans fro

2013-07-28 20:14:15 2784

原创 ZOJ3712：Hard to Play

MightyHorse is playing a music game called osu!.After playing for several months, MightyHorse discovered the way of calculating score in osu!:1. While playing osu!, player need to click some c

2013-07-28 20:10:02 2905

原创 ZOJ3705:Applications

Recently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen to take part in the ACM/ICPC competitions of the next season. As a traditional elite university in ACM

2013-07-28 11:35:25 36765 5

原创 POJ1742:Coins(多重背包)

DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice wat

2013-07-27 10:42:24 5336 3

原创 POJ3260:The Fewest Coins(混合背包)

DescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., the

2013-07-26 22:47:33 2874

原创 POJ2392：Space Elevator(多重背包)

DescriptionThe cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to

2013-07-26 10:23:54 3841 2

原创 POJ1276：Cash Machine(多重背包)

DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominatio

2013-07-25 20:18:31 8004 1

原创 POJ1787：Charlie's Change(记录路径的多重背包)

DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically the

2013-07-25 16:36:51 2843 1

原创 POJ3181：Dollar Dayz(完全背包)

DescriptionFarmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer Joh

2013-07-24 21:36:37 4886

原创 HDU1963 && POJ2063：Investment(完全背包)

Problem DescriptionJohn never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that

2013-07-24 15:56:14 3158

原创 HDU1059 && POJ1014 :Dividing(多重背包)

Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the m

2013-07-24 10:52:17 6189 3

原创 HDU2159：FATE(二维完全背包)

Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐度降到0或者0以下时，xhd就不会玩这游戏。xhd还说了他最多只杀s

2013-07-23 15:48:51 4070

原创 HDU1200：To and Fro

Problem DescriptionMo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with ext

2013-07-22 15:01:03 2937

原创 POJ1363：Rails

DescriptionThere 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. It was

2013-07-22 14:59:28 12183 1

原创 HDU1046：Gridland

Problem DescriptionFor years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are

2013-07-22 14:45:06 2823

原创 HDU3415：Max Sum of Max-K-sub-sequence(单调队列)

Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1].Now your job is to calculate

2013-07-22 14:41:28 3399 1

原创 HDU1250：Hat's Fibonacci

Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n -

2013-07-22 14:27:01 2406

原创 HDU1171：Big Event in HDU(多重背包)

Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Softwar

2013-07-21 11:02:15 1548

原创 HDU2844:Coins(多重背包)

Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a

2013-07-21 11:00:22 6624

原创 NBUT1482：嘛~付钱吧！(完全背包)

http://ac.nbutoj.com/Problem/view.xhtml?id=1482 问题描述大白菜带着套套去超市买好吃的，到了付钱的时候，收银员告诉大白菜需要付N元。大白菜突然想知道自己付钱有多少种方法，求助我们聪明的ACMER来告诉他，有几种付钱的方法。（已知，我天朝有，红色老人头，绿色老人头，黄色老人头(100,50,20,10,5,1)等等，ps:当

2013-07-20 17:10:25 1212

原创 NBUT1480:懒惰的风纪委Elaine(多重背包)

http://ac.nbutoj.com/Problem/view.xhtml?id=1480 问题描述 Elaine是学园都市中的一个风纪委，每天都会接到命令对某个街道进行检查，并抓捕危险分子。她所在的风纪委支部附近有M条街道。这些街道由北到南并排均匀的分布在一条直线上，每条街道之间的距离都为1。但是众所周知，Elaine是一个很懒很懒的人（-..-说我坏话！！被我看到了！

2013-07-20 17:08:06 2127