I have just completed Dijkstra, Bellman-Ford & Floyd Warshall algorithm. Can anyone suggest to me some good essential problems?
I have just completed Dijkstra, Bellman-Ford & Floyd Warshall algorithm. Can anyone suggest to me some good essential problems?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 130 |
https://cses.fi/problemset/
Section: Graph Algorithms
Problems: for example Shortest Paths, Shortest Paths II, Flight Discount
What did you do when you saw that you were stuck in a particular rating and didn't see any improvements?
Nothing special — I just tried to solve harder and harder problems on my own and kept participating in contests.
20C - Dijkstra?, acm, cf
Run away from graphs, they are disgusting, if I quit CP anytime soon, it's because I'm only practicing graphs this week.