5 bloatware apps you should delete from your Samsung phone ASAP
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
，详情可参考91视频
Our computers for putting up with unsafe workplaces
Now. Let’s talk about how this little war actually played out. Dramatised and Ribbed™ for your pleasure.