随笔分类 -  动态规划 递推

上一页 1 2 3 4 5
Codeforces Round #319 (Div. 2)B. Modulo Sum DP
摘要：B. Modulo Sum time limit per test ... 阅读全文
posted @ 2015-09-11 16:16 meekyan 阅读(280) 评论(0) 推荐(0) 编辑
BZOJ 1055 区间DP
摘要：1055: [HAOI2008]玩具取名Time Limit: 10 SecMemory Limit: 162 MBSubmit: 1144Solved: 668[Submit][Status][Discuss]Description某人有一套玩具，并想法给玩具命名。首先他选择WING四个字母中的任... 阅读全文
posted @ 2015-09-10 14:45 meekyan 阅读(252) 评论(0) 推荐(0) 编辑
POJ3254 状压dp
摘要：Corn FieldsTime Limit:2000MSMemory Limit:65536KDescriptionFarmer John has purchased a lush new rectang... 阅读全文
posted @ 2015-09-07 20:48 meekyan 阅读(151) 评论(0) 推荐(0) 编辑
HDU 5001 概率dp
摘要：Walk Time Limit : 30000/15000ms (Java/Other)Memory Limit : 65536/65536K (Java/Other)Special Jud... 阅读全文
posted @ 2015-09-04 19:58 meekyan 阅读(146) 评论(0) 推荐(0) 编辑
hdu 3853 概率dp
摘要：LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 3738Accepted Su... 阅读全文
posted @ 2015-09-04 13:39 meekyan 阅读(189) 评论(0) 推荐(0) 编辑
POJ 3071 概率DP
摘要：FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:3840Accepted:1959DescriptionConsider a single-elimination fo... 阅读全文
posted @ 2015-09-04 11:26 meekyan 阅读(184) 评论(0) 推荐(0) 编辑
HDU 5000 2014 ACM/ICPC Asia Regional Anshan Online DP
摘要：CloneTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 8Accepted Submission(s) : 5Font:Times New Roma... 阅读全文
posted @ 2015-09-03 23:19 meekyan 阅读(178) 评论(0) 推荐(0) 编辑
蒟蒻的树形dp记录
摘要：POJ2342：题意：某公司要举办一次晚会，但是为了使得晚会的气氛更加活跃，每个参加晚会的人都不希望在晚会中见到他的直接上司，现在已知每个人的活跃指数和上司关系（当然不可能存在环），求邀请哪些人（多少人）来能使得晚会的总活跃指数最大。题解：当i来的时候，dp[i][1] += dp[j][0];//... 阅读全文
posted @ 2015-08-26 15:18 meekyan 阅读(258) 评论(0) 推荐(0) 编辑
Codeforces Round #267 (Div. 2) C. George and Job DP
摘要：C. George and JobThe new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have... 阅读全文
posted @ 2015-08-23 19:22 meekyan 阅读(248) 评论(0) 推荐(0) 编辑
HDU 4345 Permutation dp
摘要：PermutationProblem DescriptionThere is an arrangement of N numbers and a permutation relation that alter one arrangement into a... 阅读全文
posted @ 2015-08-21 00:34 meekyan 阅读(336) 评论(0) 推荐(0) 编辑
HDU 4341 分组背包
摘要：B -Gold minerTime Limit:2000MSMemory Limit:32768KB DescriptionHomelesser likes playing Gold miners in class. He has to pay much attention to the teac... 阅读全文
posted @ 2015-08-20 19:47 meekyan 阅读(176) 评论(0) 推荐(0) 编辑
Gym 100650H Two Ends DFS+记忆化搜索
摘要：Problem H: Two EndsIn the two-player game “Two Ends”, an even number of cards is laid out in a row. On each card, faceup, is written a positive intege... 阅读全文
posted @ 2015-08-18 20:22 meekyan 阅读(305) 评论(0) 推荐(0) 编辑
【RQNOJ356】myt的格斗
摘要：题目描述’恩 ~~这个和这个也是朋友.把他们放在一起......哇!终于完成了’mty费了好大劲,终于找出了一支最为庞大的军队.fyc很高兴,立马出征与人fight.mty万万没想到fyc竟然把他也叫去了.偶像的命令不可违抗,mty只好跟着出发了.两军交战采用一对一单挑的形式.mty一上来就遇到了一... 阅读全文
posted @ 2015-07-17 21:08 meekyan 阅读(167) 评论(0) 推荐(0) 编辑
【rqnoj39】 饮食问题
摘要：题目描述Bessie 正在减肥，所以她规定每天不能吃超过 C (10 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define inf 10000000 8 using namespace std; 9 10 int main... 阅读全文
posted @ 2015-07-17 20:47 meekyan 阅读(279) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5