SPOJ - PUTNIK 区间dp

-Atlantis-

于 2017-02-23 17:51:04 发布

阅读量338

点赞数

分类专栏： dp 文章标签： dp

本文链接：https://blog.csdn.net/enamor_ac/article/details/56677172

版权

PUTNIK 是一个NP-hard问题的特殊情况，旅行商需要按特定条件访问每个城市一次，寻找总飞行时间最短的路径。输入包含城市数量和各城市之间的飞行时间，输出是最小总飞行时间。解题策略涉及区间动态规划，通过枚举最大数值的位置优化时间复杂度。

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

PUTNIK - Putnik

Chances are that you have probably already heard of the travelling salesman problem. If you have, then you are aware that it is an NP-hard problem because it lacks an efficient solution. Well, this task is an uncommon version of the famous problem! Its uncommonness derives from the fact that this version is, actually, solvable efficiently.

The travelling salesman is on a mission to visit N cities, each exactly once. The cities are represented by numbers 1, 2, …, N. What we know is the direct flight duration between each pair of cities. The salesman, being the efficient man that he is, wants to modify the city visiting sequence so that the total flight duration is the minimum possible.

Alas, all is not so simple. In addition, the salesman has a peculiar condition regarding the sequence. For each city labeled K must apply: either all cities with labels smaller than K have been visited before the city labeled K or they will