这是一篇关于计算机游戏设计的文章，讲述了如何在由n个地点和m条双向通道构成的游戏世界中，确定最多数量的必须战斗的Boss。游戏开始和结束地点未定，目标是确保从起点到终点必须通过放置了Boss的通道。文章首先介绍了问题背景，然后分析了问题本质是求无向图中两点间最长路径（树的直径），最后提供了可能的解决方案——利用Tarjan算法处理环并寻找最远路径。
一 原题
Your friend is developing a computer game. He has already decided how the game world should look like — it should consist of nn locations connected by mm two-way passages. The passages are designed in such a way that it should be possible to get from any location to any other location.
Of course, some passages should be guarded by the monsters (if you just can go everywhere without any difficulties, then it's not fun, right?). Some crucial passages will be guarded by really fearsome monsters, requiring the hero to prepare for battle and designing his own tactics of defeating them (commonly these kinds of monsters are called bosses). And your friend wants you to help him place these bosses.
The game will start in location ss and end in location tt, but these locations are not chosen yet. After choosing these locations, your friend will place a boss in each passage such that it is impossible to get from ss to
最低0.47元/天 解锁文章
166
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
