让我们从讲座中考虑令牌环通信和自稳定算法。回想下，它用于确定在环上移动的令牌的位置。
假设您是对手，您重写了节点保存的值。对所有节点一次执行。如何覆盖节点上的值，使自稳定过程花费尽可能长的时间?
为了简单起见，请假设令牌环由7个节点组成。
原文：Let us consider the token ring communication and self-stabilizing algorithm from the lecture. Recall that it was used to determine the position of the token moving on the ring.
Assume you are the adversary and you overwrite the values kept by the nodes. You do it at once for all nodes. How would you overwrite the values at the nodes so that the self-stabilization takes as long as possible?
For the sake of simplicity please assume that the token ring consists of 7 nodes.
同一所学校 同一个老师 求答案😭