队列

解密QQ号

#include <iostream>

using namespace std;

int n, a[100010], head, tail;
int v, c[100010];

int main(){
    cin >> n;
    for(int i = 1; i <= n; i ++) cin >> a[i];
    head = 1;
    tail = n + 1;
    while(head < tail){
        cout << a[head] << " ";
        head ++;
        c[v] = a[head];
        head ++;
        a[tail] = c[v];
        tail ++;
        v ++;
    }
    return 0;
}