ABC335C - Loong Tracking

最新推荐文章于 2026-06-13 09:50:47 发布

原创

最新推荐文章于 2026-06-13 09:50:47 发布 · 626 阅读

收录于

当前文章被以下社区和专栏收录：

文章描述了一种在蛇游戏中利用栈数据结构简化蛇头位置更新和查询的方法，避免了维护整个蛇身的复杂性，提高了查询和更新操作的时间复杂度至O(n+q)。

problem link

A brute force solution to this problem would be modifying all $n$ body parts with each move. However, one might notice that we don’t have to maintain the entire snake body dynamically. Since each part will take the place of the previous part, the $i$ th part will always be $i - 1$ indices down from the snake head.

With this conclusion, we can simply update the snake head position in a stack-like data structure. In each new move, we append the new position of the snake head to the stack. During queries, the $i$ th body part would be the $i$ th element down the stack. This gives us $\mathcal O(n+q)$