【HDOJ】5063 Operation the Sequence

#include <cstdio>
#include <cstring>
#include <cstdlib>

#define MAXN 100005
#define MOD 1000000007
int que[MAXN], front = 0, rear = 0;
int n;

void query(int index) {
    int r = rear;
    int square = 0;
    int half = (n+1)>>1;

    while (r-- > front) {
        if (que[r] == 3) {
            ++square;
        } else if (que[r] == 2) {
            index = n+1-index;
        } else {
            if (index > half) {
                index = (index - half)*2;
            } else {
                index = 2*index - 1;
            }
        }
    }
    __int64 ret = index%MOD;
    for (int i=0; i<square; ++i) {
        ret = ret*ret%MOD;
    }
    printf("%I64d
", ret);
}

int main() {
    int t, m;
    int x;
    char cmd[3];

    scanf("%d", &t);
    while (t--) {
        rear = 0;
        scanf("%d%d", &n, &m);
        while (m--) {
            scanf("%s %d", cmd, &x);
            if (cmd[0] == 'Q') {
                query(x);
            } else {
                que[rear++] = x;
            }
        }
    }
    return 0;
}