
拿下动态规划
本专栏主要是通过动态规划的各个类型进行分类,通过算法题进行掌握
twinslizzy维
希望是个创造者
展开
-
HDU 2602 Bone Collector (简单的0-1背包)(AC)
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24860 Accepted Submission(s): 10062 Problem Description Many year原创 2016-10-08 15:12:27 · 404 阅读 · 0 评论 -
POJ1745Divisibility(dp)(AC)
Divisibility Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11107 Accepted: 3975 Description Consider an arbitrary sequence of integers. One can place + or原创 2015-11-25 16:23:09 · 424 阅读 · 0 评论 -
POJ3624Charm Bracelet,用到了滚动数组(AC)
Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32967 Accepted: 14628 Description Bessie has gone to the mall's jewelry store and spies a ch原创 2016-07-19 11:45:06 · 498 阅读 · 0 评论 -
最长子序列和Maximum Continuous Partial SumST(AC)
Maximum Continuous Partial Sum Given any sequence, the sequence of a contiguous area as the sum of the sum is part of a continuous For example, let’s the following sequence was given In the原创 2016-07-19 17:22:07 · 573 阅读 · 0 评论