| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 5 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
3rd one the worst contributor from the last. Sorry..
They are different things though?
AFAIK DSU on trees is just the small-to-large trick applied to trees (you have an instance of a data structure on each node), and sack is more like HLD applied to MO's algorithm (you have a single global data structure and you insert into/erase from it)
I prefer the name sack though
I have a question. Does contribution gets reset after a certain period? Or it stays as it is?
I don't know, but with positive contribution, if you are inactive for a long time, it resets to 0.
How do you know so many algorithms ?
I've been doing competitive programming for 7 years. I know a lot of useless stuff.