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!
# | 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 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | cry | 161 |
3 | maomao90 | 160 |
4 | atcoder_official | 156 |
4 | -is-this-fft- | 156 |
6 | nor | 155 |
7 | maroonrk | 153 |
7 | adamant | 153 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
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!
Name |
---|
Well Dijkstra on a tree is just BFS :) Be more specific with what that means and maybe you'll get an answer.
sorry, but i don't know how to describe the idea, hmm i mean that is the trick which was used in this problem: https://mirror.codeforces.com/problemset/problem/787/D