动态规划
yjt9299
这个作者很懒,什么都没留下…
展开
-
B - Vacations codeforces_698A
题意:Vasya有假期但是假期的每一天他主要有3件事要做0:休息 1:打比赛 2:去体育馆锻炼 3:既可以打比赛也可以训练。但是连着的两天不能都打比赛或者都去体育馆。思路:在这可以有两种写法第一:可以对每一天进行枚举然后通过题目要求确定今天要干嘛。第二:dp的思想开一个dp【i】【j】数组表示第i天选择做j的最少休息天数(j = 0 ,1 , 2)。看懂这里一定要。//仔细理解原创 2017-08-17 16:15:08 · 274 阅读 · 0 评论 -
HDU 3652 (数位dp)
B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7127 Accepted Submission(s): 4166Problem DescriptionA wqb-number, or原创 2017-10-05 20:48:18 · 254 阅读 · 0 评论 -
POJ 2229
SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 20111 Accepted: 7859DescriptionFarmer John commanded his cows to search for different sets of nu原创 2017-10-05 21:05:30 · 179 阅读 · 0 评论 -
POJ 1661 Help Jimmy
Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12562 Accepted: 4169Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平原创 2017-10-11 18:03:46 · 167 阅读 · 0 评论 -
UVA 12563 Jin Ge Jin Qu hao
Jin Ge Jin Qu hao UVA - 12563 题意: 给你 n 个歌曲 和 你的唱歌的时间。 接下来是每一首歌 的时间长度 , 但是在ktv 唱歌有个bug 就是在你定的时间接受之前你再点一首歌, 假设你定了 100 秒在95秒是你选择唱了一首 劲歌金曲 那么 就相当于你多唱了 678-5 秒 你的任务是在唱的歌曲数目尽量多的情况下 要求唱原创 2017-11-07 10:46:45 · 311 阅读 · 0 评论 -
HDU 2059 龟兔赛跑 (dp)
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20096 Accepted Submission(s): 7414Problem Description据说在很久很久以前,可怜的兔子经历了人生原创 2017-10-14 12:22:15 · 210 阅读 · 0 评论 -
HDU 1026 Ignatius and the Princess I
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19922 Accepted Submission(s): 6498Special JudgeProblem原创 2017-10-15 20:33:39 · 141 阅读 · 0 评论 -
HDU 1520 树形dp
Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12941 Accepted Submission(s): 5194Problem DescriptionThere i原创 2017-10-16 20:27:59 · 189 阅读 · 0 评论 -
HDU 2196 Computer(树形 dp)
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31198 Accepted Submission(s): 3987Problem DescriptionA school bought原创 2017-10-17 11:32:16 · 172 阅读 · 0 评论 -
UVA - 1347 Tour
题目地址:点击 UVA 1347 链接样例输入: 31 12 33 141 12 33 14 2样例输出:6.47 7.89题意: 给你n个点 你的任务是求出从最左边点到最右边点 再从最右边点 回来的最短路径 (要求没个点都要走一遍) 。。思路: dp[i][j] 我们假设同时有两个人在走 那么,两个人走原创 2017-11-06 17:05:36 · 228 阅读 · 0 评论 -
hdu 2844 coins 多重背包
CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17033 Accepted Submission(s): 6737Problem DescriptionWhuacmers use coins原创 2017-12-10 16:32:17 · 203 阅读 · 0 评论 -
codeforces D. Levko and Array(二分加dp) 挺好的一个题
D. Levko and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLevko has an array that consists of inte原创 2017-12-19 10:55:53 · 350 阅读 · 0 评论 -
多段决策问题 hdu 2059 zoj 2967
据说在很久很久以前,可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后,心中郁闷,发誓要报仇雪恨,于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼,终于练成了绝技,能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟,以雪前耻。 最近正值HDU举办50周年校庆,社会各大名流齐聚下沙,兔子也趁此机会向乌龟发起挑战。虽然乌龟深知获胜希望不大,不过迫于舆论压力,只能接受挑战。 ...原创 2018-04-18 22:32:37 · 166 阅读 · 0 评论 -
hdu 4216 (dp 动态规划)
Computational Geometry?Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 700 Accepted Submission(s): 243 Problem DescriptionComputation...原创 2018-07-18 19:03:38 · 401 阅读 · 0 评论 -
2018徐州邀请赛I题 I. T-shirt
JSZKC is going to spend his vacation!His vacation has NN days. Each day, he can choose a T-shirt to wear. Obviously, he doesn't want to wear a singer color T-shirt since others will consider he has ...原创 2018-07-25 10:46:29 · 560 阅读 · 0 评论 -
hdu 6321 hdu多校第三场c题(dp)
Problem C. Dynamic Graph MatchingTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 180 Accepted Submission(s): 66 Problem Description...原创 2018-07-30 19:40:06 · 901 阅读 · 0 评论 -
牛客多校第一场 E 题 Removal dp
时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 524288K,其他语言1048576K64bit IO Format: %lld题目描述 Bobo has a sequence of integers s1, s2, ..., sn where 1 ≤ si ≤ k.Find out the number of distinct sequences modulo (109...原创 2018-07-23 09:43:05 · 269 阅读 · 0 评论 -
HDU 3555(数位dp)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 20122 Accepted Submission(s): 7508Problem DescriptionThe counter-terrori原创 2017-10-05 20:36:10 · 147 阅读 · 0 评论 -
POJ 1141 Brackets Sequence
Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32855 Accepted: 9508 Special JudgeDescriptionLet us define a regular brackets seque原创 2017-10-02 19:06:19 · 280 阅读 · 0 评论 -
NYOJ 746 整数划分(四)(区间dp)
整数划分(四)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 暑假来了,hrdv 又要留学校在参加ACM集训了,集训的生活非常Happy(ps:你懂得),可是他最近遇到了一个难题,让他百思不得其解,他非常郁闷。。亲爱的你能帮帮他吗? 问题是我们经常见到的整数划分,给出两个整数 n , m ,要求在 n原创 2017-10-02 16:18:21 · 298 阅读 · 0 评论 -
POJ 1384 Piggy-Bank
Piggy-BankTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12224 Accepted: 5908DescriptionBefore ACM can do anything, a budget must be prepared and the n原创 2017-08-17 16:25:17 · 215 阅读 · 0 评论 -
HDU 1171
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43672 Accepted Submission(s): 15012Problem DescriptionNowada原创 2017-08-17 16:42:28 · 243 阅读 · 0 评论 -
HDU 2602 Bone Collector 最简单背包
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 65995 Accepted Submission(s): 27523Problem DescriptionMany year原创 2017-08-17 16:48:08 · 151 阅读 · 0 评论 -
dp 电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。
电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。 某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。 Input多组数据。对于每组数据: 第一行为原创 2017-08-17 16:33:51 · 8090 阅读 · 1 评论 -
POJ 1050 To the Max
点击打开链接To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49427 Accepted: 26194DescriptionGiven a two-dimensional array of positive and ne原创 2017-08-17 20:40:53 · 163 阅读 · 0 评论 -
codeforces 417A A. Elimination
A. Eliminationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe finalists of the "Russian Code Cup" compe原创 2017-08-18 18:43:11 · 234 阅读 · 0 评论 -
POJ 1157 LITTLE SHOP OF FLOWERS
LITTLE SHOP OF FLOWERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21833 Accepted: 10082DescriptionYou want to arrange the window of your flower shop原创 2017-08-18 18:56:34 · 172 阅读 · 0 评论 -
POJ 1019 Number Sequence
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40208 Accepted: 11694DescriptionA single positive integer i is given. Write a program to原创 2017-08-18 20:32:15 · 173 阅读 · 0 评论 -
HDU 2089 不要62(dp)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45367 Accepted Submission(s): 17001Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音原创 2017-08-20 20:36:00 · 132 阅读 · 0 评论 -
POJ 1322 dp
ChocolateTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10605 Accepted: 2751 Special JudgeDescriptionIn 2100, ACM chocolate will be one of the favo原创 2017-08-20 20:40:43 · 178 阅读 · 0 评论 -
POJ 1609 简单dp
Tiling Up BlocksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5929 Accepted: 2316DescriptionMichael The Kid receives an interesting game set from his原创 2017-08-20 20:55:49 · 232 阅读 · 0 评论 -
POJ 1745 dp
DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12454 Accepted: 4453DescriptionConsider an arbitrary sequence of integers. One can place + o原创 2017-08-20 21:14:42 · 165 阅读 · 0 评论 -
POJ - 1276 Cash Machine
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37244 Accepted: 13484DescriptionA Bank plans to install a machine for cash withdrawal. The m原创 2017-09-23 11:31:17 · 187 阅读 · 0 评论 -
HDU 3555(数位dp)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 19861 Accepted Submission(s): 7380Problem DescriptionThe counter-terrori原创 2017-09-09 20:03:57 · 191 阅读 · 0 评论 -
HDU 4734 f(x)
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6560 Accepted Submission(s): 2532Problem DescriptionFor a decimal number x原创 2017-09-29 20:20:56 · 202 阅读 · 0 评论 -
NYOJ 737 石子合并(一)(区间dp)
石子合并(一)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 有N堆石子排成一排,每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆,每次合并花费的代价为这两堆石子的和,经过N-1次合并后成为一堆。求出总的代价最小值。输入有多组测试数据,输入到文件结束。每组测试数据第一行有一个整原创 2017-10-01 21:12:32 · 226 阅读 · 0 评论 -
牛客网Wannafly 21 大水题(dp)
链接:https://www.nowcoder.com/acm/contest/159/C来源:牛客网 题目描述现在给你N个正整数ai,每个数给出一“好数程度” gi(数值相同但位置不同的数之间可能有不同的好数程度)。对于在 i 位置的数,如果有一在j位置的数满足 j < i 且 ai=aj,则你可以将位于[i,j]闭区间内的序列评为“好序列”,然后获得∑gk(j≤k≤i)(此闭...原创 2018-08-04 10:24:17 · 223 阅读 · 0 评论