Longest Path Problem in Special Sparse Graph

Правка en1, от micah.stairs, 2016-09-20 00:28:13

Hello,

I have spent considerable time thinking about this NENA ICPC Regional problem from a few years ago and have not been able to come up with a solution: https://open.kattis.com/problems/hopper

I have also scoured the internet for an editorial or a solution and have not come up with anything (although there is one accepted solution on Kattis).

Any thoughts?

-Micah

Теги kattis, longest path, sparse graph, hamiltonian

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский micah.stairs 2016-09-20 00:28:13 427 Initial revision (published)