这篇博客讲述了如何使用Dijkstra算法和状态压缩动态规划（状压DP）解决HDU 4568 Hunter问题，该问题与TSP旅行商问题相关。作者首先尝试了hdu-4571，然后意识到需要处理任意两点间的最短路径。由于本题中必经点较少，作者采用状态压缩来存储已通过的点，增加了虚拟起止节点以简化问题，但在实现过程中出现错误，导致了长时间的调试。
Hunter
http://acm.hdu.edu.cn/showproblem.php?pid=4568
Problem Description
One day, a hunter named James went to a mysterious area to find the treasures. James wanted to research the area and brought all treasures that he could.
The area can be represented as a N*M rectangle. Any points of the rectangle is a number means the cost of research it,-1 means James can't cross it, James can start at any place out of the rectangle, and explore point next by next. He will move in the rectangle and bring out all treasures he can take. Of course, he will end at any border to go out of rectangle(James will research every point at anytime he cross because he can't remember whether the point are researched or not).
Now
The area can be represented as a N*M rectangle. Any points of the rectangle is a number means the cost of research it,-1 means James can't cross it, James can start at any place out of the rectangle, and explore point next by next. He will move in the rectangle and bring out all treasures he can take. Of course, he will end at any border to go out of rectangle(James will research every point at anytime he cross because he can't remember whether the point are researched or not).
Now
最低0.47元/天 解锁文章
扫一扫
2997
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
