随笔分类 -  ACM--动态规划

上一页 1 2
UVA10118（记忆化搜索 + 好题）
摘要：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19440 题意，4堆不同颜色的糖果，每堆N个，从堆上往下拿，放入一个最大装5个糖果的篮子里，如果糖果颜色相同就能将这两个放入自己口袋，问最多能放多少 分析：dp[1][2][3] 阅读全文
posted @ 2016-01-05 23:15 zhaop 阅读(225) 评论(0) 推荐(0)
POJ2677 Tour(DP+双调欧几里得旅行商问题)
摘要：TourTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3929Accepted: 1761DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacati... 阅读全文
posted @ 2016-01-03 21:39 zhaop 阅读(361) 评论(0) 推荐(0)
UVA1025---A Spy in the Metro（DP)
摘要：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=35913Secret agent Maria was sent to Algorithms City to carry out an especially dangerous m... 阅读全文
posted @ 2015-12-30 19:39 zhaop 阅读(200) 评论(0) 推荐(0)
POJ1390Blocks(DP+好题+抽空再来理解理解）
摘要：Blocks Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 4744 Accepted: 1930 Description Some of you may have played a game called 'Blocks'. 阅读全文
posted @ 2015-12-22 19:24 zhaop 阅读(800) 评论(0) 推荐(0)
POJ1037A decorative fence(动态规划+排序计数+好题）
摘要：http://poj.org/problem?id=1037题意：输入木棒的个数n，其中每个木棒长度等于对应的编号，把木棒按照波浪形排序，然后输出第c个;分析：总数为i跟木棒中第k短的木棒 就等于总数为i-1中比这一根短的方案数 + 和比这一根长的方案数；最后用一个三维数组表示成c[i][k][up... 阅读全文
posted @ 2015-12-22 11:42 zhaop 阅读(201) 评论(0) 推荐(0)
POJ1088滑雪（dp+记忆化搜索）
摘要：滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 86411Accepted: 32318DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不... 阅读全文
posted @ 2015-12-19 21:09 zhaop 阅读(183) 评论(0) 推荐(0)
POJ1976A Mini Locomotive(01背包装+连续线段长度）
摘要：A Mini LocomotiveTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 2485Accepted: 1388DescriptionA train has a locomotive that pulls the train w... 阅读全文
posted @ 2015-12-17 20:28 zhaop 阅读(444) 评论(0) 推荐(0)
POJ1745Divisibility(01背包思想)
摘要：DivisibilityTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 11151Accepted: 3993DescriptionConsider an arbitrary sequence of integers. One can... 阅读全文
posted @ 2015-12-17 19:22 zhaop 阅读(200) 评论(0) 推荐(0)
poj1631Bridging signals(最长单调递增子序列 nlgn)
摘要：Bridging signalsTime Limit:1000MSMemory Limit:10000KTotal Submissions:12251Accepted:6687Description'Oh no, they've done it again', cries the chief des... 阅读全文
posted @ 2015-12-09 19:36 zhaop 阅读(198) 评论(0) 推荐(0)

上一页 1 2