12 D — Ball

Revision en1, by lllAlonsolll, 2016-05-09 02:51:02

Hi guys! Can someone explain me please, how to use BIT in this problem? http://codeforces.me/problemset/problem/12/D I've seen than some contestants has solved using BIT but I didn't understand how they do. Thanks in advance! :)

Tags binary indexed tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English lllAlonsolll 2016-05-10 05:50:41 0 (published)
en2 English lllAlonsolll 2016-05-09 02:54:19 7 (saved to drafts)
en1 English lllAlonsolll 2016-05-09 02:51:02 240 Initial revision (published)