最終更新日：2025/12/05
By applying square root decomposition, we reduced the query time from O(n) to O(√n) by processing the input in blocks of size √n.
正解を見る
By applying square root decomposition, we reduced the query time from O(n) to O(√n) by processing the input in blocks of size √n.
音声機能が動作しない場合はこちらをご確認ください
編集履歴（0）
