Zeolim的博客

模拟链表 #include <iostream> using namespace std; const int MAXN = 1e5 + 10; int head = 1; struct num { int right; int left; }arr[MAXN]; void joinl(int x, int y) { arr[x].left = ...