动态规划
键盘崩坏
这个作者很懒,什么都没留下…
展开
-
HDU1159: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 e原创 2014-08-10 23:17:57 · 320 阅读 · 0 评论 -
POJ1664:放苹果(整数划分)
Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。Input第一行是测试数据的数目t(0 Output对输入的每组数据M和N,用一行输出相应的K。Sample Input17 3Sample Output8原创 2014-09-15 23:29:47 · 480 阅读 · 0 评论 -
HDU4521:小明系列问题——小明序列(推广LIS(带区间))
Problem Description 大家都知道小明最喜欢研究跟序列有关的问题了,可是也就因为这样,小明几乎已经玩遍各种序列问题了。可怜的小明苦苦地在各大网站上寻找着新的序列问题,可是找来找去都是自己早已研究过的序列。小明想既然找不到,那就自己来发明一个新的序列问题吧!小明想啊想,终于想出了一个新的序列问题,他欣喜若狂,因为是自己想出来的,于是将其新序列问题命名为“小明序列”。原创 2014-08-13 23:32:04 · 576 阅读 · 0 评论 -
HDU4512:吉哥系列故事——完美队形I(LICS)
#include #include #include using namespace std;int a[505],b[505],dp[505],n,m,cnt;int mark[505][505],ans[505];int LICS(){ int i,j,MAX,k; memset(dp,0,sizeof(dp)); memset(mark,0,size原创 2014-08-14 17:24:47 · 325 阅读 · 0 评论 -
HDU1025:Constructing Roads In JGShining's Kingdom(LIS(dp+二分))
摘:链接:http://acm.hdu.edu.cn/forum/read.php?tid=15580&fpage=0&page=1假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7,可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B,然后令 i = 1 to 9 逐个考察这个序列。此外,我们用一个变量Len来记录现在最长算到多原创 2014-08-13 14:08:30 · 436 阅读 · 0 评论 -
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 chi原创 2014-08-13 19:57:28 · 297 阅读 · 0 评论 -
HDU1257:最少拦截系统(LIS)
Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里原创 2014-08-13 10:07:08 · 379 阅读 · 0 评论 -
HDU1513(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, dete原创 2014-08-11 22:14:53 · 688 阅读 · 0 评论 -
HDU1003:Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +原创 2014-08-11 16:20:06 · 311 阅读 · 0 评论 -
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 doe原创 2014-08-11 21:54:08 · 472 阅读 · 0 评论 -
POJ:1283 Moving Computer(限制划分个数的整数划分)
DescriptionAssurance Company of Moving (ACM) is a company of moving things for people. Recently, some schools want to move their computers to another place. So they ask ACM to help them. One schoo原创 2014-09-17 09:29:50 · 719 阅读 · 0 评论