摘要：http://hi.baidu.com/zldiablo/item/32f3e614de94f48d88a9560dNot very easy to identify the dp recurrence relation at first sight.. but strip your artific... 阅读全文

摘要：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... 阅读全文

摘要：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] -... 阅读全文

摘要：I can feel that I am making great progress now.. if inspected closely, it is obvious that what I'm getting through is, a newbie phase:coding details m... 阅读全文

摘要：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:/... 阅读全文

摘要：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... 阅读全文

摘要：(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... 阅读全文

摘要：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... 阅读全文