TC ProblemsToSolve

ProblemsToSolve

 * http://www.topcoder.com/stat?c=problem_statement&pm=7504

Summary
Given a sequence of up to 50 numbers, find the smallest subset such that
 * the range between the minimum and maximum is sufficiently large,
 * the sequence begins with the first number and has gaps of length at most 1.

From TopCoder Single Round Match 340, Division 1, Level 1 (250 points).

Hints

 * Dynamic programming is overkill!
 * Start by choosing two numbers whose range is sufficiently large.