8-dohyeondol1

dohyeondol1/README.md

@@ -8,4 +8,5 @@
  | 4차시 | 2025.03.28 |  BFS  | [점프왕 쩰리 (Large)](https://www.acmicpc.net/problem/16174)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/15|
  | 5차시 | 2025.04.02 |  DFS & BFS  | [DFS와 BFS](https://www.acmicpc.net/problem/1260)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/18|
  | 6차시 | 2025.04.05 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/22|
- ---
+ | 7차시 | 2025.04.08 |  트리  | [트리 순회](https://www.acmicpc.net/problem/1991)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/26|
+ | 8차시 | 2025.04.11 |  덱  | [회전하는 큐](https://www.acmicpc.net/problem/1021)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/32|

dohyeondol1/덱/8-dohyeondol1.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <deque>
+#include <algorithm>
+using namespace std;
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+    int N, M;
+    cin >> N >> M;
+
+    deque<int> dq;
+    for(int i = 1; i <= N; i++) 
+        dq.push_back(i);
+
+    vector<int> target(M);
+    for(int i = 0; i < M; i++) 
+        cin >> target[i];
+
+    int count = 0;
+    for(int i = 0; i < M; i++) {
+        int index = find(dq.begin(), dq.end(), target[i]) - dq.begin();
+
+        if(index <= dq.size()/2) {
+            while(index--) {
+                dq.push_back(dq.front());
+                dq.pop_front();
+                count++;
+            }
+        } else{
+            int step = dq.size() - index;
+            while(step--) {
+                dq.push_front(dq.back());
+                dq.pop_back();
+                count++;
+            }
+        }
+        dq.pop_front();
+    }
+
+    cout << count << '\n';
+}