DP动态规划
理想主义文艺青年
理想主义源于对生活的憧憬 文艺是对生活的态度
展开
-
2017Google Codejam round1c Problem B. Parenting Partnering
ProblemCameron and Jamie are longtime life partners and have recently become parents! Being in charge of a baby, exciting as it is, is not without challenges. Given that both parents have a scient原创 2017-04-30 21:20:23 · 668 阅读 · 0 评论 -
hdu 1203 I NEED A OFFER!(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19084 Accepted Submission(s): 7648Problem DescriptionSpeakless原创 2015-06-03 16:16:36 · 339 阅读 · 0 评论 -
hdu 1506 Largest Rectangle in a Histogram(dp)
Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13467 Accepted Submission(s): 3810Problem Descrip原创 2015-06-02 18:30:27 · 351 阅读 · 0 评论 -
hdu 2084 数塔(dp)
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26731 Accepted Submission(s): 16086Problem Description在讲述DP算法的时候,一个经典的例子就是数原创 2015-06-03 00:38:44 · 412 阅读 · 0 评论 -
hdu 2571 命运(dp)
命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11762 Accepted Submission(s): 4127Problem Description穿过幽谷意味着离大魔王lemon已经无限接近原创 2015-06-02 23:41:17 · 347 阅读 · 0 评论 -
hdu 1505 City Game(dp)
City GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5425 Accepted Submission(s): 2330Problem DescriptionBob is a strateg原创 2015-06-02 18:34:01 · 300 阅读 · 0 评论 -
hdu 2159 FATE(二维完全背包)
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9277 Accepted Submission(s): 4368Problem Description最近xhd正在玩一款叫做FATE的游戏,为原创 2015-06-01 22:48:10 · 954 阅读 · 0 评论 -
hdu 1069 Monkey and Banana(dp)
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9051 Accepted Submission(s): 4682Problem DescriptionA group原创 2015-06-02 23:58:36 · 369 阅读 · 0 评论 -
hdu 3033 I love sneakers!(分组背包)
I love sneakers!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4396 Accepted Submission(s): 1792Problem DescriptionAfter mon原创 2015-06-01 23:22:32 · 363 阅读 · 0 评论 -
hdu 1176 免费馅饼(dp)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30931 Accepted Submission(s): 10530Problem Description都说天上不会掉馅饼,但有一天gameb原创 2015-06-03 16:23:27 · 344 阅读 · 0 评论 -
hdu 1978 How many ways(记忆化搜索dp)
How many waysTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3663 Accepted Submission(s): 2135Problem Description这是一个简单的生存游戏,原创 2015-06-04 12:23:13 · 408 阅读 · 0 评论 -
hdu 2577 How to Type(dp)
How to TypeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4552 Accepted Submission(s): 2057Problem DescriptionPirates have f原创 2015-06-03 16:36:49 · 460 阅读 · 0 评论 -
2017Google Codejam round1c Problem A. Ample Syrup
ProblemThe kitchen at the Infinite House of Pancakes has just received an order for a stack of K pancakes! The chef currently has N pancakes available, where N ≥ K. Each pancake is a cylinder, a原创 2017-04-30 21:15:21 · 968 阅读 · 0 评论 -
hihocode 1290 Demo Day(DP)
#1290 : Demo Day时间限制:10000ms单点时限:1000ms内存限制:256MB描述You work as an intern at a robotics startup. Today is your company's demo day. During the demo your company's robot wil原创 2016-04-21 14:39:26 · 532 阅读 · 0 评论 -
light oj 1284 - Lights inside 3D Grid(求期望)
1284 - Lights inside 3D GridPDF (English)StatisticsForumTime Limit: 4 second(s)Memory Limit: 32 MBYou are given a 3D grid, which has dimensions X, Y and原创 2015-07-23 16:21:38 · 659 阅读 · 0 评论 -
light oj 1248 - Dice (III)(概率dp)
1248 - Dice (III)PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBGiven a dice with n sides, you have to find the expected number o原创 2015-07-22 20:01:37 · 994 阅读 · 0 评论 -
light oj 1038 - Race to 1 Again(概率dp求期望 记忆化搜索)
1038 - Race to 1 AgainPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBRimi learned a new thing about integers, which is - any posi原创 2015-06-04 23:06:32 · 705 阅读 · 0 评论 -
light oj 1422 Halloween Costumes(区间dp)
1422 - Halloween CostumesPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGappu has a very busy weekend ahead of him. Because, next原创 2015-06-10 00:48:54 · 491 阅读 · 0 评论 -
poj 2955 Brackets(区间dp)
北京大学暑期课:《ACM/ICPC竞赛训练》面向全球招生Language:DefaultBracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3907 Accepted: 2053DescriptionWe原创 2015-06-10 01:18:24 · 333 阅读 · 0 评论 -
light oj A Dangerous Maze(概率dp求期望)
1030 - Discovering GoldPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are in a cave, a long cave! The cave can be represented原创 2015-06-04 22:55:34 · 640 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping!(dp)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26314 Accepted Submission(s): 11644Problem Descri原创 2015-06-02 23:17:20 · 332 阅读 · 0 评论 -
hdu 2870 Largest Submatrix(dp)
Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1856 Accepted Submission(s): 879Problem DescriptionNow here原创 2015-06-02 18:41:43 · 437 阅读 · 0 评论 -
hdu 1712 ACboy needs your help(分组背包)
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4848 Accepted Submission(s): 2609Problem DescriptionACbo原创 2015-06-01 23:01:10 · 783 阅读 · 0 评论 -
hdu 3496 Watch The Movie(二维01背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6316 Accepted Submission(s): 2012Problem DescriptionNew semest原创 2015-05-29 12:54:30 · 785 阅读 · 0 评论 -
poj 1141 Brackets Sequence(区间dp)
Language:DefaultBrackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27063 Accepted: 7654 Special JudgeDescriptionLet us define a原创 2015-06-17 21:54:03 · 418 阅读 · 0 评论 -
poj 1651 Multiplication Puzzle(区间dp 矩阵链乘法)
Language:DefaultMultiplication PuzzleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6965 Accepted: 4268DescriptionThe multiplication puzzle is pl原创 2015-06-17 10:14:53 · 558 阅读 · 0 评论 -
2013 亚洲区域赛 长沙站
Alice's Print ServiceTime Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KBTotal submit users: 22, Accepted users: 14Problem 13161 : No special judgementProblem de原创 2015-02-05 15:56:49 · 961 阅读 · 0 评论 -
汉密尔顿回路求解
汉密尔顿通路:给定图G,若存在一条经过图中的每个顶点一次且仅一次的通路,则称这条通路为汉密尔顿通路。汉密尔顿回路:若存在一条回路,经过图中的每个顶点一次且仅一次,则称这条回路为汉密尔顿回路。汉密尔顿图:具有汉密尔顿回路的图称为汉密尔顿图。zoj 2398 poj 2288地图中有许多岛屿 沿着桥访问每个岛屿一次且仅一次的路径每个岛屿还有相应的权值 根据路径原创 2014-11-28 20:25:27 · 4803 阅读 · 0 评论 -
HNU Profits
ProfitsTime Limit: 2000ms,Special Time Limit:5000ms, Memory Limit:65536KBTotal submit users: 13,Accepted users: 13 Problem 13042 : No special judgementProblem descripti原创 2014-10-04 16:16:35 · 698 阅读 · 0 评论 -
hdu 4939 Stupid Tower Defense
hdu 4939 Stupid Tower Defense题意呢 就是关原创 2014-08-13 19:10:58 · 1515 阅读 · 0 评论 -
CSU 1374: Restore Calculation
题意:就是输入三行数据,使得第一行的数据加上第二行的数据等于第三行的。每组数据可能会有'?',代表一个未知的数,每个?代表的数字可以不一样,每行最多有50个字符,首字符不可为0。计算总共有多少种可能。代码:#include #include #include #include using namespace std原创 2014-08-11 15:02:50 · 839 阅读 · 0 评论 -
01背包入门
01背包问题模型:有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是:f[i][v]=max{f[i-1][v],f[i-1][v-原创 2015-05-29 00:36:05 · 1226 阅读 · 0 评论 -
完全背包入门
有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。这个问题非常类似于01背包问题,所 不同的是每种物品有无限件。也就是从每种物品的角度考虑,与它相关的策略已并非取或不取两种,而是有取0件、取1件、取2件……等很多种。如果仍然按照解 01背包时的思路,令f[i][v]表示原创 2015-05-29 17:05:56 · 754 阅读 · 0 评论 -
hdu 2476 String painter(区间dp)
String painterTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2150 Accepted Submission(s): 941Problem DescriptionThere are tw原创 2015-06-19 00:45:53 · 633 阅读 · 0 评论 -
hdu 1059 Dividing(多重背包)
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19539 Accepted Submission(s): 5491Problem DescriptionMarsha and Bill原创 2015-05-31 00:34:43 · 771 阅读 · 0 评论 -
NBUT 1480&&hdu 2844 (多重背包)
两题题意不再赘述 虽然描述不同 但是意思是一样的。。。而且两题的代码也是一样的。。。。下面给出O(log amount)时间处理一件多重背包中物品的过程,其中amount表示物品的数量:procedure MultiplePack(cost,weight,amount) if cost*amount>=V CompletePack(cost,weight)原创 2015-05-31 00:32:03 · 774 阅读 · 0 评论 -
hdu 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17961 Accepted Submission(s): 7566Problem Description原创 2015-05-31 00:29:21 · 302 阅读 · 0 评论 -
hdu 1963 poj 2063 Investment(完全背包)
Language:DefaultInvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9191 Accepted: 3186DescriptionJohn never knew he had a grand-uncle, unti原创 2015-05-30 00:58:24 · 1267 阅读 · 0 评论 -
poj 3280 Cheapest Palindrome(区间dp)
Language:DefaultCheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6637 Accepted: 3219DescriptionKeeping track of all the cows can原创 2015-06-17 19:40:40 · 432 阅读 · 0 评论 -
hdu 1284 钱币兑换问题(完全背包 母函数)
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7270 Accepted Submission(s): 4272Problem Description在一个国家仅有1分,2分,3分硬币,将原创 2015-05-29 20:45:16 · 945 阅读 · 0 评论