查看会员资料
用 户 名：张***
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
problem-2620
- 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).