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!
Please read the new rule regarding the restriction on the use of AI tools. It applies starting from round 972.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 161 |
| 2 | Um_nik | 160 |
| 2 | maomao90 | 160 |
| 4 | awoo | 159 |
| 5 | atcoder_official | 157 |
| 6 | -is-this-fft- | 156 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
→ Find user
→ Recent actions
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: Sep/16/2024 09:27:36 (k3).
Desktop version, switch to mobile version.
Supported by
