| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Easy implementation of Compressed 2D Binary Indexed Tree for binary grid
In this implementation an Order Statistics Tree(more about [](http://codeforces.me/blog/entry/11080)) is embedded at each node in a BIT. It only works if a 2D BIT has to be implemented for a binary grid of numbers.
PS: Suggestions are welcome. Please notify if there are any mistakes.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
sdnr1 | 2017-05-21 22:59:54 | 138 | Problems added | |
| en6 |
|
sdnr1 | 2017-05-21 09:47:43 | 10 | ||
| en5 |
|
sdnr1 | 2017-05-21 09:44:03 | 0 | (published) | |
| en4 |
|
sdnr1 | 2017-05-21 09:43:14 | 8 | ||
| en3 |
|
sdnr1 | 2017-05-21 09:41:22 | 1568 | Tiny change: 'f size $N x N$: 1 - I' -> 'f size $N \cross N$: 1 - I' | |
| en2 |
|
sdnr1 | 2017-05-21 08:35:46 | 260 | ||
| en1 |
|
sdnr1 | 2017-05-21 08:20:22 | 364 | Initial revision (saved to drafts) |
