hdu1224 dp动态规划+图论

最新推荐文章于 2024-05-22 23:37:07 发布

小川先生

最新推荐文章于 2024-05-22 23:37:07 发布

阅读量2.6k

点赞数 1

分类专栏： dp动态规划文章标签： hdu1224

本文链接：https://blog.csdn.net/stc_xc/article/details/51290881

版权

该问题要求从城市1开始，通过选择旅行价值最高的路径到达编号为n+1（与1相同）的城市。每座城市都有其旅行价值，并且不能从编号大的城市直飞到编号小的城市。输入包含城市数量、旅行价值列表以及直飞航线信息。解决方案是使用动态规划求解最大旅行价值，并记录最优路径。

摘要由CSDN通过智能技术生成

Free DIY Tour

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5837 Accepted Submission(s): 1868

Problem Description
Weiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is so satisfied with their job that he decide to provide them a free tour around the world. It’s a good chance to relax themselves. To most of them, it’s the first time to go abroad so they decide to make a collective tour.

The tour company shows them a new kind of tour circuit - DIY circuit. Each circuit contains some cities which can be selected by tourists themselves. According to the company’s statistic, each city has its own interesting point. For instance, Paris has its interesting point of 90, New York has its interesting point of 70, ect. Not any two cities in the world have straight flight so the tour company provide a map to tell its tourists whether they can got a straight flight between any two cities on the map. In order to fly back, the company has made it impossible to make a circle-flight on the half way, using the cities on the map. That is, they marked each city on the map with one number, a city with higher number has no straight flight to a city with lower number.

Note: Weiwei always starts from Hangzhou(in this problem, we assume Hangzhou is always the first city and also the last city, so we mark Hangzhou both 1 and N+1), and its interesting point is always 0.

Now as the leader of the team, Weiwei wants to make a tour as interesting as possible. If you were Wei