题目描述题目链接题目大意有n个点，每个点的编号为i。有3种，一共m个操作：1）将y连到x的后面（保证x后面和y前面没有连点）2）将x-y的连接断开（保证一定存在x-y的连接）3）输出x所在的链（按顺序输出）题目分析设pre[x] //记录x的前驱节点，ne[x] //记录x的后继节点这样我们连接/断开边时都只需要操作pre[]和ne[]数组即可。输出x所在的链也只需要顺着链表往前和往后遍历即可。代

题目描述The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.Errichto gave Monogon the following challenge in order to intimidate

题目描述The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.Errichto gave Monogon the following challenge in order to intimidate