[HDU 1276]士兵队列训练问题

这道题直接模拟即可，我也不是很懂为什么放在队列和栈里，估计学长是想让我们用栈和队列写吧。但是个人觉得数组更好理解，其实栈和队列跟数组本质上都差不多。

#include <bits/stdc++.h>
#define maxn 5000 + 10
int main(){
    int in;
    while (~scanf("%d", &in)){
        while (in--){
            int left, a[maxn], b[maxn], c[maxn], num;
            int flag = 1;
            scanf("%d", &num);
            left = num;
            int r = 0;
            for(int i = 0; i < num; i++)
                a[i] = i+1, b[i] = i, c[i] = 1;

            if(left <= 3){
                for (int i = 0; i < left; i++){
                    if(r) printf(" %d", a[i]);
                    else printf("%d", a[i]);
                    r = 1;
                }printf("\n");
            }else {
                int j = 0;
                for (int i = 0; i < num; i++)
                    if(c[i]) b[j++] = i;

                while (left > 3){
                    int j = 0;
                    if (flag){
                        for(int i = 1; i < left; i+=2)
                            c[b[i]] = 0;
                        left =left - left / 2;
                    } else {
                        for(int i = 2; i < left; i+=3)
                            c[b[i]] = 0;
                        left = left - left / 3;
                    }
                    flag = !flag;
                    for(int i = 0; i < num; i++) if(c[i]) b[j++] = i;
                    r = 0;
                }
                for(int i = 0; i < left; i++)
                {
                    if(r) printf(" %d", a[b[i]]);
                    else printf("%d", a[b[i]]);
                    r = 1;
                }
                printf("\n");
            }
        }
    }
    return 0;
}