2605 줄 세우기

#include <stdio.h>
#include <stack>
#include <queue>
 
using namespace std;
 
int arr[105] = { 0 };
int rst[105] = { 0 };
deque<int> dq;
stack<int> tmp;
 
int main() {
    int n, num;
    scanf("%d", &n);
    getchar();
 
    for (int i = 1; i <= n; i++) {
        scanf("%d", &arr[i]);
    }
 
    for (int i = 1; i <= n; i++) {
        num = arr[i];
 
        while (num--) {
            int backN = dq.back();
            dq.pop_back();
            tmp.push(backN);
        }
        dq.push_back(i);
 
        while (tmp.empty() == false) {
            int topN = tmp.top();
            dq.push_back(topN);
 
            tmp.pop();
        }
    }
 
    int idx = 0;
    while (dq.empty() == false) {
        int f = dq.front();
        dq.pop_front();
 
        printf("%d ", f);
    }
}