Last Updated:2025/12/05

To speed up range-sum queries during the competition, I implemented a Fenwick tree to support dynamic updates and prefix-sum queries in logarithmic time.

See correct answer

To speed up range-sum queries during the competition, I implemented a Fenwick tree to support dynamic updates and prefix-sum queries in logarithmic time.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)
Source Sentence

コンテスト中に区間和の照会を高速化するため、累積和を維持しつつ動的な更新と照会を対数時間で行える二分インデックス木(Binary Indexed Tree、BIT)を実装しました。

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★