Like the N-convex algorithm, this algorithm attempts to find a set of candidates whose centroid is close to . The key difference is that instead of taking unique candidates, we allow candidates to populate the set multiple times. The result is that the weight of each candidate is simply given by its frequency in the list, which we can then index by random selection:
圖像來源，Po/@polarts_
，更多细节参见谷歌浏览器【最新下载地址】
香港政府否認有關說法。政府發言人回覆BBC查詢表示，執法部門和法院對個別人士採取的行動，「與其政治立場、背景或職業無關」。
// 逻辑：只要左侧元素最小值，说明该元素需纳入无序区间，左边界左移