DP
文章平均质量分 77
夨落旳尐孩
我要这天,再遮不住我眼,要这地,再埋不了我心,要这众生,都明白我意,要那诸佛,都烟消云散。
展开
-
hdu 1003 Max Sum
Max SumTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):59834 AcceptedSubmission(s): 13613Problem DescriptionGiven a sequence a[1],a[2原创 2013-09-11 14:06:51 · 759 阅读 · 0 评论 -
dp 1836 Alignment
此题题目意思没看懂开始,其实就是求减去最少的元素,使剩下的队列满足:a1 < a2 < a3... a(i+1)> a(i+2) > .. a(n-1)>a(n)所以求出一个各个递增子序列,递减子序列之后找出相加之后最大者即可。#include#include#include#includeusing namespace std;int n,l,b[1001],c[100原创 2013-09-11 14:08:42 · 868 阅读 · 0 评论 -
dp 3267 The Cow Lexicon
问题给定你一个字符串,和n个单词构成的字典。让你求出在字符串中最小删去几个字母,使得剩下的字符串能够由字典中的若干个单词构成。输出最少删去的字母的个数。分析如果考虑第i位的字母,当然只有要和不要两种状态,这是本题的突破口,是划分状态的根本。f[i]表示到第i位最少需要删除的字母的数目,dp[i]表示把前i位变成合法序列删去的最少字符dp[i]=min(dp[i],dp[j-1]+i-原创 2013-09-11 14:08:40 · 761 阅读 · 0 评论 -
dp训练 1005
Human Gene FunctionsTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :20 AcceptedSubmission(s) : 14Font: Times NewRoman | Verdana | Georgi原创 2013-09-11 14:07:41 · 874 阅读 · 0 评论 -
hdu 1087
Super Jumping! Jumping! Jumping!TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):9706 AcceptedSubmission(s): 3993Problem DescriptionNo原创 2013-09-11 14:06:56 · 707 阅读 · 0 评论 -
hdu 1081 To The Max
To The MaxTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):3622 AcceptedSubmission(s): 1721Problem DescriptionGiven a two-dimensional原创 2013-09-11 14:06:53 · 701 阅读 · 0 评论 -
hdu 1759 Function Run Fun
Function Run FunTimeLimit: 1000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):976 AcceptedSubmission(s): 556Problem DescriptionWe all love recursio原创 2013-09-11 14:06:49 · 849 阅读 · 0 评论 -
hdu 2084 数塔
数塔TimeLimit: 1000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):7659 AcceptedSubmission(s): 4563Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的原创 2013-09-11 14:06:47 · 645 阅读 · 0 评论 -
dp训练 1004
Humble NumbersTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :21 AcceptedSubmission(s) : 15Font: Times NewRoman | Verdana | GeorgiaFon原创 2013-09-11 14:07:45 · 804 阅读 · 0 评论 -
dp训练 1003
Constructing Roads In JGShining's KingdomTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :50 AcceptedSubmission(s) : 16Font: Times NewRom原创 2013-09-11 14:07:43 · 866 阅读 · 0 评论 -
poj 3661 running
题目叙述条件比较多:Bessie参加跑步比赛,每一分钟可以选择跑或者休息,同时给出每一分钟如果跑的话,可以跑的距离:跑的话,疲劳度会加1,对应的分钟可以跑对应的距离;休息的话,疲劳度减1;且疲劳度不可以超过m。跑完后疲劳度必须为0,求满足条件可以跑得最远距离。我以为动态方程是这样的dp[i][j]=max(dp[i-1][j-1]+a,dp[i-1][j+1]);但不是,可能是因为。当疲劳度为原创 2013-09-11 14:09:00 · 904 阅读 · 0 评论