Problem Description
There are N schedules, the i-th schedule has start time
si and end time
ei (1 <= i <= N). There are some machines. Each two overlapping schedules cannot be performed in the same machine. For each machine the working time is defined as the difference between
timee
最低0.47元/天 解锁文章
扫一扫
1084
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
