To find these crucial border points, we employed a clever technique based on the Ford-Fulkerson algorithm. By simulating "flooding" roads with traffic from random start/end points, we could identify the natural bottlenecks – the "minimum cut" in graph theory terms. These bottlenecks became our border points.
每轮从未排序部分找到最小元素，放到已排序部分末尾
ВсеПолитикаОбществоПроисшествияКонфликтыПреступность。safew官方下载对此有专业解读
Why the FT?See why over a million readers pay to read the Financial Times.，更多细节参见同城约会
struct Node *next;，详情可参考搜狗输入法下载
while (stack.length && temperatures[stack.at(-1)] <= cur) {