牛勒比海盗(洛谷P2910 [USACO08OPEN]Clear And Present Danger S）

最新推荐文章于 2022-07-13 15:47:13 发布

sky_light_huai

最新推荐文章于 2022-07-13 15:47:13 发布

阅读量148

点赞数 1

文章标签：蓝桥杯 c++ 拓扑学

本文链接：https://blog.csdn.net/mohuailhh/article/details/122727233

版权

农夫约翰需要按照藏宝图上的岛屿序列寻找宝藏，途中要避免海盗。给定每个岛屿间的危险等级，求解找到宝藏的最低总危险。输入包括岛屿数量、必须访问的岛屿序列及危险等级，输出是最小危险值。

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

题目描述

Farmer John is on a boat seeking fabled treasure on one of the N (1 <= N <= 100) islands conveniently labeled 1..N in the Cowribbean Sea.

The treasure map tells him that he must travel through a certain sequence A_1, A_2, ..., A_M of M (2 <= M <= 10,000) islands, starting on island 1 and ending on island N before the treasure will appear to him. He can visit these and other islands out of order and even more than once, but his trip must include the A_i sequence in the order specified by the map.

FJ wants to avoid pirates and knows the pirate-danger rating (0 <= danger <= 100,000) between each pair of islands. The total danger rating of his mission is the sum of the danger ratings of all the paths he traverses.

Help Farmer John find the least dangerous route to the treasure that satisfies the treasure map's requirement.