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