| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Easy implementation of Compressed 2D Binary Indexed Tree for binary grid
In this implementation an Order Statistics Tree(more about [](http://codeforces.net/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) |
