[链表(linked list)] [洛谷] P1160 队列安排

模拟链表ios #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 = y;

>>阅读原文<<