"So to flood that seemed like a completely daft idea."
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
。业内人士推荐搜狗输入法下载作为进阶阅读
Other campaign groups, like the Wildlife Trusts, insist that many more fish are at risk. They highlight research from Natural England that found that over seven million fish would die if no measures whatsoever were put in place.。业内人士推荐爱思助手下载最新版本作为进阶阅读
Англия — Премьер-лига|28-й тур