FT Digital Edition: our digitised print edition
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
，详情可参考PDF资料
In addition, ahead of an official announcement, Apple leaked news of a cheaper MacBook called the MacBook Neo. Whoops! We may well see a formal reveal of that on Wednesday. In the meantime, here’s our recap of everything Apple has announced so far this week:
Фото: Mohamed Azakir / Reuters
Армия обороны Израиля начала масштабную серию ударов по Ирану02:17