Codyssi 2025 Day 13
Автор: Jonathan Paulson
Загружено: 2025-03-30
Просмотров: 117
Problem: https://www.codyssi.com/view_problem_17
Graphs. Part 3 caught me by surprise; I was expecting something else to do with shortest paths, but longest is completely different as far as I know. I used dynamic programming, with state (current_location, used_locations, target). This is exponential time, but fortunately the input graph is relatively small.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: