| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3650 |
| 2 | Benq | 3582 |
| 3 | Geothermal | 3570 |
| 3 | orzdevinwang | 3570 |
| 5 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3532 |
| 8 | Radewoosh | 3522 |
| 9 | Um_nik | 3483 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Problem :
Given a weighted directed graph with both negative and positive edges, Find a path from vertex 1 to n, in which minimum subpath weight(starting from vertex 1) is maximum.
I can't think of any graph algorithm that can help me solve this problem, so any suggestions are appreciated.
N<=500
constraints?
easi task
Binary search for the answer plus BFS to check if it's possible. Details: think.
I've never heard of BFS on weighted graph ... how would that be done ?
I parsed "subpath" as "edge"...
If they're paths from vertex 1, it's modified Dijkstra (you only have to ignore possible paths with length < checked answer).
I used a combination of Dijkstra & DP and it worked. Thank You Xellos
Could you please post the question link? I would like to solve it too.
Thanks in advance :)