http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=970&sca=99&sfl=wr_hit&stx=1697 JUNGOL www.jungol.co.kr #include struct Node { Node* pPrev, *pNext; int my; Node() {} Node(Node* prev, Node* next, int n) : pPrev(prev), pNext(next), my(n) { prev->pNext = this; next->pPrev = this; } } H, T; int N, cnt; Node* pCur = &H; void enque(int n) { new Node(T.pPrev, &T, n); cnt++; } int deque() { No..