Problem

Source: 2015 Argentina OMA Finals L3 p4

Tags: combinatorics, combinatorial geometry



An segment $S$ of length $50$ is covered by several segments of length $1$ , all of them contained in $S$. If any of these unit segments were removed, $S$ would no longer be completely covered. Find the maximum number of unit segments with this property. Clarification: Assume that the segments include their endpoints.