// 易错点4：条件写成"<"而非"<="，会导致相同值的元素被错误保留
Continue reading...
，推荐阅读Line官方版本下载获取更多信息
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.
swap(&arr[i], &arr[j]);