子序列
liang_all
这个作者很懒,什么都没留下…
展开
-
HDU 1257 子序列
最少拦截系统Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊原创 2013-08-21 19:49:08 · 403 阅读 · 0 评论 -
HDU 1423 子序列
Greatest Common Increasing SubsequenceProblem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is descr原创 2013-08-22 09:56:46 · 464 阅读 · 0 评论 -
HDU 1159 子序列
Common SubsequenceProblem 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 subsequ原创 2013-08-22 15:47:50 · 438 阅读 · 0 评论 -
HDU 2087 子序列
剪花布条Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不原创 2013-08-22 15:58:44 · 443 阅读 · 0 评论 -
HDU 1711 子序列
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8436 Accepted Submission(s): 3854Problem DescriptionGiven two s原创 2013-08-22 15:55:15 · 424 阅读 · 0 评论 -
HDU 2594 子序列
Simpsons’ Hidden Talents Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example.原创 2013-08-22 16:06:36 · 470 阅读 · 0 评论 -
HDU 1025 子序列
Constructing Roads In JGShining's Kingdom 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 thes原创 2013-08-22 16:08:48 · 481 阅读 · 0 评论 -
HDU 1686 子序列
Oulipo Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:原创 2013-08-22 16:02:13 · 459 阅读 · 0 评论