思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
今年前三季度销售开支到了 12.80 亿，比去年一整年花的还多……
。业内人士推荐51吃瓜作为进阶阅读
I close my eyes and picture a boat making its way towards the mainland. Lit only by moonlight, a silhouette walks towards a post box and mails three letters, one by one. Then, the familiar tune of ABBA’s Gimme! Gimme! Gimme! (A Man After Midnight) starts to play, and the musical begins.，更多细节参见safew官方下载
Pokémon United
CC: Regulatory authorities, policymakers, and the Android developer community