1021 회전하는 큐 문제 풀이 #include #include using namespace std; int main() { deque dq; int m, n, cnt = 0; cin >> n >> m; for (int i = 1; i > num; for (int i = 0; i < n; i++) { if (dq[i] == num) { idx = i; break; } } if (idx < dq.size() / 2 + 1) { for (int i = 0; i < dq.size(); i++) { if (dq.front() == num) { dq.pop_front(); break; } dq.push_back(dq.front()); dq.pop_front(); cnt++; } } else { for (int i..