Is it possible to write Fenwick tree for sum in segment and for update(+val) in segment? And is it optimally?
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 160 |
4 | atcoder_official | 159 |
4 | Um_nik | 159 |
6 | djm03178 | 156 |
7 | adamant | 153 |
8 | luogu_official | 149 |
8 | awoo | 149 |
10 | TheScrasse | 146 |
Is it possible?
Is it possible to write Fenwick tree for sum in segment and for update(+val) in segment? And is it optimally?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
ru5 |
![]() |
Zhanibekkk | 2019-03-04 12:26:12 | 21 | Мелкая правка: 'а отрезке?' -> 'а отрезке? И оптимально ли это?' | |
en3 |
![]() |
Zhanibekkk | 2019-03-04 12:25:19 | 22 | Tiny change: 'n segment?' -> 'n segment?\nAnd is it optimally?' | |
en2 |
![]() |
Zhanibekkk | 2019-03-04 12:13:28 | 0 | (published) | |
ru4 |
![]() |
Zhanibekkk | 2019-03-04 12:12:55 | 0 | (опубликовано) | |
ru3 |
![]() |
Zhanibekkk | 2019-03-04 12:12:26 | 11 | Мелкая правка: 'для суммы и с приба' -> 'для суммы на отрезке и с приба' | |
en1 |
![]() |
Zhanibekkk | 2019-03-04 12:11:44 | 103 | Initial revision for English translation (saved to drafts) | |
ru2 |
![]() |
Zhanibekkk | 2019-03-04 12:04:42 | 2 | ||
ru1 |
![]() |
Zhanibekkk | 2019-03-04 12:03:59 | 84 | Первая редакция (сохранено в черновиках) |
Name |
---|