Jane的私房菜

题目：http://acm.hdu.edu.cn/showproblem.php?pid=2084这题如果从上往下递推就要分两种情况写递推式：if(i-j>=1)dp[i][j]=max(dp[i-1][j]+dp[i-1][j+1])+当前[i][j]的值elsedp[i][j]=dp[i-1][j-1]+当前[i][j]的值但是如果倒过来考虑，也就是从底部开始往上递

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 + 4 = 14.

DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. T

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 exists a st

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1158动态规划（表示我的dp好弱，挽尊~~~）dp[i][j]表示第i个月雇佣j人的最小代价。其中j大于等于当月需求人数，小于等于这几个月中需求最大的那个月的人数。状态转移方程: dp[i][j]=min(dp[i-1][k]+当月代价,dp[i][j])   k大于等于i-1月需求人数，小

dp[i]表示到字符串第i个时

各位数之和不会超过100，所