Hi i am new to virtual tree, I'm finding some OI problem to pratice can someone recommend for me some good problem. Thanks!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 161 |
| 3 | maomao90 | 159 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
Hi, I've just solved a problem by using a technique called "Dijkstra on Segment Tree", I rly want to practice more, can someone recommend some problems using this trick? Thanks!
Hi guys, I'm new to DP how we can solve a problem DP need sorting for optimize order like this problem: https://atcoder.jp/contests/dp/tasks/dp_x.
Idk how to improve the optimal sorting order. Can some one help me and tell me how to solve problem like that? D:
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/04/2024 12:23:47 (j3).
Desktop version, switch to mobile version.
Supported by
