dp
chen_zan_yu_
同是寒窗苦读,岂能甘拜下风
展开
-
N - Longest Ordered Subsequence (最长递增子序列)
题目链接:https://cn.vjudge.net/contest/254828#problem/N A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any se...原创 2018-10-02 15:15:31 · 153 阅读 · 0 评论 -
A - Max Sum Plus Plus (把一串数字取其中的m段使他的和最大)
滴答滴答---题目链接 Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult p...原创 2018-10-17 23:21:32 · 122 阅读 · 0 评论 -
B - Ignatius and the Princess IV ()
滴答滴答---题目连接 "OK, you are not too bad, em... But you can never pass the next test." feng5166 says. "I will tell you an odd number N, and then N integers. There will be a special integer among them, ...原创 2018-10-17 23:35:13 · 328 阅读 · 1 评论 -
E - Super Jumping! Jumping! Jumping! (求最大的递增子序列的和,不用连续)
Nowadays, 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. The game ...原创 2018-10-18 19:45:31 · 201 阅读 · 0 评论 -
基础dp C Monkey and Banana (类最长上升子序列)
滴答滴答---题目链接 A 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 some blocks...原创 2018-10-19 21:12:31 · 130 阅读 · 0 评论 -
背包问题之多重背包
滴答滴答---题目链接 多重背包介于0-1背包和完全背包之间:有容积为V的背包给定一些物品,每种物品包含体积w,价值v和数量k,求用该背包能 装下的最大价值总量。可以将多重背包问题直接转化到0-1背包上去,即将每种物品被均视为k种不同的物品。 0-1背包的介绍可见另一博文 http://www.cnblogs.com/yuxiaoba/p/8458135.html ...原创 2018-10-21 00:53:50 · 179 阅读 · 0 评论 -
Dire Wolf(区间DP)
Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 4002 Accepted Submission(s): 2375 Problem Description Dire wolves, also kno...原创 2018-10-27 17:06:41 · 319 阅读 · 0 评论 -
H - Commandos (自闭了~~~dp)
Statements A commando is a soldier of an elite light infantry often specializing in amphibious landings, abseiling or parachuting. This time our Commando unit wants to free as many hostages as it cou...原创 2018-11-04 00:21:25 · 279 阅读 · 0 评论 -
基础DP---硬币问题
DP初步:状态转移与递推 eg: 最少硬币问题 有多个不同面值的硬币(任意面值); 数量不限; 输入金额S,输出最少硬币组合。 思路: int type[ ] = {1, 5, 10, 25, 50}; //5种面值硬币 定义数组 int Min[ ] 记录最少硬币数量: 对输入的某个金额i,Min[i]是最少的硬币数量。 第一步: 只考虑1元面值的硬币(把Min...原创 2019-05-26 20:40:47 · 792 阅读 · 1 评论 -
P1048 采药(dp)
滴答滴答---题目链接 题目描述 辰辰是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说:“孩子,这个山洞里有一些不同的草药,采每一株都需要一些时间,每一株也有它自身的价值。我会给你一段时间,在这段时间里,你可以采到一些草药。如果你是一个聪明的孩子,你应该可以让采到的草药...原创 2018-10-06 13:19:31 · 460 阅读 · 0 评论 -
FATE (二维完全背包)
第爱迪达--提,题目链接 最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s只怪。请问他...原创 2018-10-12 17:15:28 · 138 阅读 · 0 评论 -
F - Piggy-Bank——HOJ 一维DP 装载问题
滴答滴答---题目链接 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 (IBM). The idea beh...原创 2018-10-02 16:20:55 · 622 阅读 · 4 评论 -
01背包,完全背包,多重背包(18.10.2)
链接:https://blog.csdn.net/tinyguyyy/article/details/51203935 链接:https://blog.csdn.net/LYHVOYAGE/article/details/8545852原创 2018-10-02 16:35:20 · 124 阅读 · 0 评论 -
hdu1260(递推+处理时间)(18.10.2)
Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he ...原创 2018-10-02 17:19:08 · 419 阅读 · 0 评论 -
H - Tickets
Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as...原创 2018-10-11 15:26:20 · 127 阅读 · 0 评论 -
Bone Collector(01背包经典题目)
背包之01背包、完全背包、多重背包详解 PS:大家觉得写得还过得去,就帮我把博客顶一下,谢谢。 首先说下动态规划,动态规划这东西就和递归一样,只能找局部关系,若想全部列出来,是很难的,比如汉诺塔。你可以说先把除最后一层的其他所有层都移动到2,再把最后一层移动到3,最后再把其余的从2移动到3,这是一个直观的关系,但是想列举出来是很难的,也许当层数n=3时还可以模拟下,再大一些就不可能了,所以,诸...原创 2018-10-11 20:57:12 · 303 阅读 · 0 评论 -
Piggy-Bank (完全背包)
完全背包: 完全背包(CompletePack): 有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。 完全背包按其思路仍然可以用一个二维数组来写出: f[i][v]=max{f[i-1][v-k*c[i]]+k*w[i]|0<=k*c[i]<=v} 同...原创 2018-10-12 00:00:55 · 297 阅读 · 0 评论 -
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
多重背包 多重背包(MultiplePack): 有N种物品和一个容量为V的背包。第i种物品最多有n[i]件可用,每件费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。 这题目和完全背包问题很类似。基本的方程只需将完全背包问题的方程略微一改即可,因为对于第i种物品有n[i]+1种策略:取0件,取1件……取n[i]件。令f[i][v]表示...原创 2018-10-12 00:00:48 · 107 阅读 · 0 评论 -
P1049 装箱问题(01背包)
滴答滴答---题目链接 题目描述 有一个箱子容量为VV(正整数,0 \le V \le 200000≤V≤20000),同时有nn个物品(0<n \le 300<n≤30,每个物品有一个体积(正整数)。 要求nn个物品中,任取若干个装入箱内,使箱子的剩余空间为最小。 输入输出格式 输入格式: 11个整数,表示箱子容量 11个整数,表示有nn个物品 接下来nn行,...原创 2018-10-12 00:00:36 · 474 阅读 · 0 评论 -
Investment(完全背包)
滴答滴答---题目链接 John never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John w...原创 2018-10-12 16:38:50 · 295 阅读 · 0 评论 -
饭卡(01背包)
滴答滴答---题目链接 饭卡 Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53544Accepted Submission(s): 18175 Problem Description ...原创 2019-09-11 13:10:07 · 88 阅读 · 0 评论