I'm learning binary lifting right now, already solved LCA and http://mirror.codeforces.com/problemset/problem/932/D.
Can you please suggest other problems that can be solved via binary lifting, I want to train this technique.
Thank you.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
I'm learning binary lifting right now, already solved LCA and http://mirror.codeforces.com/problemset/problem/932/D.
Can you please suggest other problems that can be solved via binary lifting, I want to train this technique.
Thank you.
Название |
---|
609E - Minimum spanning tree for each edge This is a good problem solvable with binary lifting.
thx
588E - Duff in the Army. Nice problem, maybe some complex implementation, but if You'll solve it, You'll definitely have no problems with Binary Rise
Thnx.. It is a really nice problem on the topic.
Old topic, but for those stumbling upon it through Google like me, here is another one: 1516D — Cut
Here is another one from codechef LGSEG
Another good one: Teleporter
1535E - Gold Transfer is a nice starter problem for binary lifting on trees.