dp
文章平均质量分 77
fanesemyk
这个作者很懒,什么都没留下…
展开
-
HDU 1069 Monkey and Banana(DP)
Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with som原创 2016-03-07 21:11:16 · 301 阅读 · 0 评论 -
POJ 1664 放苹果
Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。 Input第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。 Output对输入的每组数据M和N,用一行输出相应的K。 Sample Input1 7 3 Sampl转载 2017-03-21 19:23:40 · 260 阅读 · 0 评论 -
hdu 5781 ATM Machine
首先分享一篇将这道题目讲的很好的博客:http://blog.csdn.net/kyleyoung_ymj/article/details/52097240本来卡住了,看了这个博客就会做了。然后说一下我做这道题目的感触:1. 这个状态转移方程实际上我已经推导出来,但是因为之前没有做过概率的dp,误认为求期望要把所有可能情况的dp都算一下最后求平均,然后脑子里一算发现复杂度爆了,就没想下原创 2017-01-20 22:29:12 · 323 阅读 · 0 评论 -
背包九讲中的公式
void ZeroOnePack(int value,int cost){ for(int j=m;j>=cost;j--) dp[j]=max(dp[j],dp[j-cost]+value);}void CompletePack(int value,int cost){ for(int j=cost;j<=m;j++) dp[j]=max(转载 2016-07-30 16:26:29 · 405 阅读 · 0 评论 -
hdu 5791 Two 二维前缀和
Alice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1,2} and {1,2} are same. {1,2,4} and {1,4,2} are not same. A' is a subseque原创 2016-08-04 10:53:34 · 628 阅读 · 0 评论 -
hdu 1501 Zipper dp
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrari转载 2016-08-03 19:26:20 · 293 阅读 · 0 评论 -
hdu 2546 饭卡
Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。 Inpu原创 2016-07-30 20:11:51 · 203 阅读 · 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 these cities are rich in resource (we call them rich原创 2016-07-30 19:56:29 · 350 阅读 · 0 评论 -
cf 429B
题目链接 CODEFORCES 429B这道题是看了题解做出来的,不多说,学习吧Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with转载 2016-03-09 01:20:24 · 334 阅读 · 0 评论 -
hdu 1257 一个很巧妙的动态规划
Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求原创 2016-03-07 21:23:00 · 349 阅读 · 0 评论 -
Codeforces 797E Array Queries
题目a is an array of n positive integers, all of which are not greater than n.You have to process q queries to this array. Each query is represented by two numbers p and k. Several operations are perform原创 2017-06-18 11:53:57 · 312 阅读 · 0 评论