队列
解密QQ号
1 #include <iostream> 2 3 using namespace std; 4 5 int n, a[100010], head, tail; 6 int v, c[100010]; 7 8 int main(){ 9 cin >> n; 10 for(int i = 1; i <= n; i ++) cin >> a[i]; 11 head = 1; 12 tail = n + 1; 13 while(head < tail){ 14 cout << a[head] << " "; 15 head ++; 16 c[v] = a[head]; 17 head ++; 18 a[tail] = c[v]; 19 tail ++; 20 v ++; 21 } 22 return 0; 23 }
