思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
Что думаешь? Оцени!
。Line官方版本下载是该领域的重要参考
British designer Annie Doble, whose eponymous brand was formed in Ibiza, is in her third year of showcasing at LFW despite several years working in the fashion industry.
Surface-to-air missiles, which are capable of shooting down aircraft and ballistic missiles, will be located on Yonaguni, Japan’s westernmost island
Фото: Сергей Бобылев / ТАСС