Hello
I want to try training by reading hard problems and then reading their editorial immediately and implementing them did anyone try this training approach before.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Hello
I want to try training by reading hard problems and then reading their editorial immediately and implementing them did anyone try this training approach before.
Hello I have a question if I have a tree with n nodes and all nodes have some value there are two types of queries
what is the max node value in the path (u,v)
update u to be equal to x
I think HLD can solve this problem but I want to know if there is other ways or techniques that can solve a problem like this
Thank you
edit:
Why does eveybody keep downvoting I just had a question
I want to make a challenge for myself I want to reach candidate master in the next 2 months can you tell me an advice to make a plan to improve quickly
thank you
I try to be better in dp and saw so much videos and I am still not good in dp I try to solve problems but I find it hard to come up with a dp solution
Название |
---|