动态规划
文章平均质量分 63
青龙指引你
也并非所有的流浪者都迷失了自我
展开
-
hdu 4508 湫湫系列故事——减肥记I (最简单的完全背包)
典型的完全背包问题,题中的卡路里代表的就是重量,幸福值代表的就是价值,题目完全没有什么坑。对每种食物和重量都遍历一次就可以找到吸收卡路里为M获得的最大幸福值了。原创 2017-04-07 20:24:36 · 431 阅读 · 0 评论 -
总结——01背包问题 (动态规划算法)
0-1 背包问题:给定 n 种物品和一个容量为 C 的背包,物品 i 的重量是 wi,其价值为 vi 。问:应该如何选择装入背包的物品,使得装入背包中的物品的总价值最大?原创 2017-04-25 20:57:57 · 209937 阅读 · 78 评论 -
hihoCoder 1338 : A Game(dp)
A GameTime limit:1000ms Memory limit:256MB Problem DescriptionLittle Hi and Little Ho are playing a game. There is an integer array in front of them. They take turns (Little Ho goes first) to select a原创 2017-10-21 22:18:53 · 367 阅读 · 0 评论 -
POJ 1276:Cash Machine (多重背包)
Cash MachineTime limit:1000 ms Memory limit:10000 kB Problem DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash a原创 2017-10-17 20:44:38 · 409 阅读 · 0 评论 -
HDU 1025:Constructing Roads In JGShining's Kingdom(DP)
JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.原创 2017-09-05 20:09:21 · 296 阅读 · 0 评论 -
HDU 1003:Max Sum(简单dp)
求最大字段和原创 2017-09-04 19:55:07 · 288 阅读 · 0 评论 -
CodeForces 607B:Zuma(区间DP)
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as po原创 2017-08-06 11:30:38 · 556 阅读 · 0 评论 -
CodeForces 455A:Boredom (动态规划)
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.原创 2017-08-03 16:48:23 · 918 阅读 · 0 评论 -
2017百度之星资格赛 1003:度度熊与邪恶大魔王(DP)
度度熊为了拯救可爱的公主,于是与邪恶大魔王战斗起来。邪恶大魔王的麾下有n个怪兽,每个怪兽有a[i]的生命值,以及b[i]的防御力。度度熊一共拥有m种攻击方式,第i种攻击方式,需要消耗k[i]的晶石,造成p[i]点伤害。当然,如果度度熊使用第i个技能打在第j个怪兽上面的话,会使得第j个怪兽的生命值减少p[i]-b[j],当然如果伤害小于防御,那么攻击就不会奏效。如果怪兽的生命值降为0或以下,那么怪兽就会被消灭。原创 2017-08-05 17:06:18 · 3269 阅读 · 8 评论 -
POJ 1651:Multiplication Puzzle(区间DP)
Multiplication PuzzleTime limit:1000 ms Memory limit:65536 kB Problem DescriptionThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move pla原创 2017-08-04 20:58:55 · 422 阅读 · 0 评论 -
HDU 4283:You Are the One(区间DP)
The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so it attract a lot of boys an原创 2017-08-04 20:48:15 · 277 阅读 · 0 评论 -
POJ 2955:Brackets(区间DP)
We give the following inductive definition of a “regular brackets” sequence:the empty sequence is a regular brackets sequence,if s is a regular brackets sequence, then (s) and [s] are regular brackets sequen原创 2017-08-04 20:04:32 · 452 阅读 · 0 评论 -
CSU 1592:石子归并(区间DP)
现在有n堆石子,第i堆有ai个石子。现在要把这些石子合并成一堆,每次只能合并相邻两个,每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。原创 2017-08-04 19:43:29 · 479 阅读 · 0 评论 -
SCU 1114:数字三角(动态规划)
下图是个数字三角,请编写一个程序计算从顶部至底部某处一条路径,使得该路径所经过的数字总和最大。原创 2017-08-03 21:00:36 · 508 阅读 · 0 评论 -
UVA 12034:Race (动态规划)
Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, codedand wandered around, even in their holidays. They passed several months in this way. But everythinghas an e原创 2017-08-03 20:40:46 · 457 阅读 · 0 评论 -
hdu 4502 吉哥系列故事——临时工计划 (动态规划)
吉哥系列故事——临时工计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3855 Accepted Submission(s): 1526Problem Description 俗话说一分钱难倒英雄原创 2017-04-07 20:55:41 · 536 阅读 · 0 评论 -
总结——背包问题解析及模板代码
作者:kangroger 原文地址:01背包问题和完全背包问题背包问题解析及模板代码01背包问题:01背包问题:一个背包总容量为V,现在有N个物品,第i个 物品体积为weight[i],价值为value[i],现在往背包里面装东西,怎么装能使背包的内物品价值最大? 看到这个问题,可能会想到贪心算法,但是贪心其实是不对的。例如最少硬币找零问题,要用动态规划。动态规划思想就是解决子问题并记录子问题转载 2017-07-10 21:53:54 · 620 阅读 · 0 评论 -
ZCMU 1919: kirito's 星爆气流斩(多重背包+二进制优化)
但是星曝气流斩需要很庞大的法力值。 现在商店有N个药品,kirito的物品栏有W的容量。 第i个药品有重量w_i,可以恢复法力值v_i,有数量c_i个。 现在请你帮助kirito计算他可以恢复的最大法力值。原创 2017-05-27 11:51:17 · 748 阅读 · 0 评论 -
PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) dp
题目链接1007. Maximum Subsequence Sum (25)Time limit:400 ms Memory limit:65536 kBProblem DescrpitionGiven a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to...原创 2018-03-13 21:59:21 · 192 阅读 · 0 评论