Now, OsmAnd performs another Dijkstra search, but this time on the much smaller "base graph." This graph consists only of the border points and the pre-calculated shortcut values between them.
* @returns {number[]} 每个元素的下一个更大值（无则-1）
。Line官方版本下载对此有专业解读
Москвичи пожаловались на зловонную квартиру-свалку с телами животных и тараканами18:04
优点：计算简单，导数恒为1（正区间），缓解梯度消失