unit record techniques—keypunch, sorting bins, mechanical totalizers—to present
FT App on Android & iOS
，推荐阅读Line官方版本下载获取更多信息
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
"It's the early days and they're still showing this in small numbers at the moment.