动态规划
文章平均质量分 56
默默Silence
这个作者很懒,什么都没留下…
展开
-
Noj - 苹果
苹果时间限制:3000 ms | 内存限制:65535 KB难度:3描述ctest有n个苹果,要将它放入容量为v的背包。给出第i个苹果的大小和价钱,求出能放入背包的苹果的总价钱最大值。输入有多组测试数据,每组测试数据第一行为2个正整数,分别代表苹果的个数n和背包的容量v,n、v同时为0时结束测试,此时不输出。接下来的n行,每行2个原创 2017-04-27 15:13:26 · 223 阅读 · 0 评论 -
动态规划(状态压缩)--铺地板
欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦:Markdown和扩展Markdown简洁的语法代码块高亮图片链接和图片上传LaTex数学公式UML序列图和流程图离线写博客导入导出Markdown文件丰富的快捷键快捷键加粗 Ctrl + B 斜体 Ctrl + I 引用 Ctrl原创 2017-11-24 17:07:53 · 956 阅读 · 0 评论 -
DP(记忆化搜索) -- poj Function Run Fun
Function Run Fun Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19948 Accepted: 10034 DescriptionWe all love recursion! Don’t we? Consider a three-parameter recursive functio原创 2017-12-08 14:58:54 · 139 阅读 · 0 评论 -
树形dp--Anniversary party
Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12972 Accepted Submission(s): 5203Problem Description There is going to原创 2017-10-18 22:24:58 · 183 阅读 · 0 评论 -
(DP,二维背包)Watch The Movie--HDOJ
Watch The Movie Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 893 Accepted Submission(s): 335Problem Description New semester is coming, and D原创 2017-07-25 08:28:35 · 682 阅读 · 0 评论 -
(DP,多重背包) Ahui Writes Word -- HDOJ
Ahui Writes Word Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 948 Accepted Submission(s): 288Problem Description We all know that English is原创 2017-07-24 15:53:35 · 252 阅读 · 0 评论 -
(DP,分组背包) I love sneakers! -- HDOJ
I love sneakers!Problem Description After months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sne原创 2017-07-24 14:32:53 · 239 阅读 · 0 评论 -
(DP,多重背包) Coins --HDOJ
Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 878 Accepted Submission(s): 357Problem Description Whuacmers use coins.They have coins of原创 2017-07-24 11:15:46 · 193 阅读 · 0 评论 -
(DP,背包,只有价值)Big Event in HDU -- HDOJ
Big Event in HDU Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer Col原创 2017-07-23 16:31:30 · 171 阅读 · 0 评论 -
(DP,背包,数量不限,装满)Piggy-Bank -- HDOJ
Piggy-Bank Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (原创 2017-07-23 11:26:17 · 218 阅读 · 0 评论 -
(DP,迷宫,最大加权路径)命运
命运 Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑! 可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧! 命运大迷宫可以看成是一个两维的方格阵列原创 2017-07-23 10:25:35 · 811 阅读 · 0 评论 -
(DP,最长上升子序列变形)Monkey and Banana--HDOJ
Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1059 Accepted Submission(s): 643 Problem Description A group of researchers原创 2017-07-22 16:44:59 · 165 阅读 · 0 评论 -
(DP)FatMouse's Speed --HDOJ
FatMouse’s Speed Problem Description FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of原创 2017-07-22 14:52:47 · 195 阅读 · 0 评论 -
区间dp--NYOJ石子合并1
/* 区间dp http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=737 题意:n堆排列好的石子,两两结合,结合花费两堆石子之和 问,最少的花费 思路:区间dp,dp[i][j]表示i堆结合到j堆所用最少的花费 三层循环,第一层控制宽度,即要求区间的范围 第二层控制区间起始位置,第三层枚举...原创 2018-04-19 15:49:34 · 145 阅读 · 0 评论