思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
A turbulent home life
，详情可参考51吃瓜
3014223110http://paper.people.com.cn/rmrb/pc/content/202602/26/content_30142231.htmlhttp://paper.people.com.cn/rmrb/pad/content/202602/26/content_30142231.html11921 我国发明专利申请量连续多年全球居首，推荐阅读91视频获取更多信息
Reconstruct — Replays operations in chronological order per file path. Write ops set content, Edit ops apply string replacements, and Read ops capture snapshots. The --before flag uses binary search to cut off at any point in time.，详情可参考同城约会
Photograph: Simon Hill