最終更新日:2022/12/24

This problem can be solved in time O(nᶜ) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2].

音声機能が動作しない場合はこちらをご確認ください
編集履歴(0)

Sentence quizzes to help you learn to read

編集履歴(0)

ログイン / 新規登録

 

アプリをダウンロード!
DiQt

DiQt(ディクト)

無料

★★★★★★★★★★