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