Description: Given set of line segments [Li, Ri] with integer coordinates of their end points. Your task is to find the minimal subset of the given set which covers segment [0, M] completely (M is a positive integer).
To Search:
- [problem-2573] - n people wish to cross a bridge at night
- [02_pthread] - Fiberxon experimental arm 3000 developme
File list (Check if you may need any files):
Download