Problem description: Visit and Support LintCode Search via Difficulty: Hard Tags: LintCode, Dynamic Programming, O(m * n), Hard ProblemSolutionCodeProblem