Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

随笔分类 -  POJ

poj.org
POJ #1033 - Defragment
摘要：First, 写POJ的报告用毛英文啊...这道题思路不算难，主要参考了这里：http://www.cnblogs.com/damacheng/archive/2010/09/24/1833983.html讲得很清楚，但是代码有点复杂，我个人觉得不需要：循环情况可以当作非循环的一个特殊情况，简单处理... 阅读全文
posted @ 2014-07-16 12:04 Tonix 阅读(455) 评论(0) 推荐(0)

POJ #1011 - Sticks
摘要：This is really classic searching problem to solve. The key is pruning.(My reference:http://blog.csdn.net/lyy289065406/article/details/6647960)There ar... 阅读全文
posted @ 2014-07-15 06:27 Tonix 阅读(200) 评论(0) 推荐(0)

POJ #2411 - Mondriaan's Dream
摘要：Good reference:http://www.cppblog.com/sdfond/archive/2009/07/31/91761.htmlIt is a classic coverage\dp compression problem. Initially I thought of dp[i... 阅读全文
posted @ 2014-07-07 04:23 Tonix 阅读(186) 评论(0) 推荐(0)

POJ #1276 - Cash machine
摘要：I tried several solutions except the one fromhttp://love-oriented.com/pack/P03.html (wonderful resource to learn DP), but all failed with WA\TLE. Afte... 阅读全文
posted @ 2014-07-05 04:44 Tonix 阅读(186) 评论(0) 推荐(0)

POJ #1260 - Pearls
摘要：DP is, enumeration + pruning. If you can think of enumeration pattern of a problem, plus a recurrence relation later, you are there.Main ref:http://bl... 阅读全文
posted @ 2014-07-01 14:02 Tonix 阅读(130) 评论(0) 推荐(0)

POJ #1221 - NIMODAL PALINDROMIC DECOMPOSITIONS
摘要：http://hi.baidu.com/zldiablo/item/32f3e614de94f48d88a9560dNot very easy to identify the dp recurrence relation at first sight.. but strip your artific... 阅读全文
posted @ 2014-06-30 13:16 Tonix 阅读(168) 评论(0) 推荐(0)

POJ #1080 - Human Gene Functions
摘要：A classic 2D DP problem. A disguise of LCS - actually not very hard to decode: it is about 2 sequences' matching, though with a weight value of each m... 阅读全文
posted @ 2014-06-28 14:24 Tonix 阅读(185) 评论(0) 推荐(0)

POJ #1050 - To the Max
摘要：Looks quite intuitive at the very first sight... I thought:rect[x, y, w+1, h+1] = rect[x, y, w, h] + num[x + w + 1, y..y+h+1] + num[x..x+w+1, y+h+1] -... 阅读全文
posted @ 2014-06-25 14:19 Tonix 阅读(202) 评论(0) 推荐(0)

POJ #1141 - Brackets Sequence - TODO: POJ website issue
摘要：A bottom-up DP. To be honest, it is not easy to relate DP to this problem. Maybe, all "most"\"least" problems can be solved using DP..Reference:http:/... 阅读全文
posted @ 2014-06-24 14:22 Tonix 阅读(182) 评论(0) 推荐(0)

POJ #1042 Gone Fishing - WA by a DP solution. TODO
摘要：I used DP instead of Greedy. But got WA on PoJ, though it passed all web-searched cases. Maybe I have to use Greedy.BTW: a careless modification intro... 阅读全文
posted @ 2014-06-23 13:14 Tonix 阅读(232) 评论(0) 推荐(0)

POJ #1015 - Jury Compromise - TODO: POJ website issue
摘要：(poj.org issue. Not submitted yet)This is a 2D DP problem, very classic too. Since I'm just learning, so I took this link as reference:http://blog.csd... 阅读全文
posted @ 2014-06-23 07:01 Tonix 阅读(165) 评论(0) 推荐(0)

POJ #2479 - Maximum sum
摘要：Hi, I'm back.This is a realy classic DP problem to code.1. You have to be crystal clear about what you are going to solve.2. Apparently there are 2 DP... 阅读全文
posted @ 2014-06-17 15:47 Tonix 阅读(139) 评论(0) 推荐(0)