Truck History ( 卡车历史)

SHOUXIN11111

于 2019-08-11 14:06:35 发布

阅读量941

点赞数 1

CC 4.0 BY-SA版权

分类专栏：最小生成树文章标签：最小生成树

本文链接：https://blog.youkuaiyun.com/shiuxin/article/details/98871964

该问题要求找到最优的卡车类型衍生计划，其中距离定义为代码中不同字母的位置数。每种卡车类型从一种其他类型派生，目标是最小化所有派生类型的总距离。输入包含卡车类型代码，输出是最佳计划的质量，即1/Σ(距离)，利用最小生成树策略求解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on.

Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not der