���f�B�A�ꗗ | ����SNS | �L���ē� | ���₢���킹 | �v���C�o�V�[�|���V�[ | RSS | �^�c���� | �̗p���� | ������
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
，这一点在旺商聊官方下载中也有详细论述
"Those are deeply personal experiences where you want to hear from other people who have been there. I think you can't really get that in other places."
// may be buffered in memory waiting for this branch