HDU 5929 Basic Data Structure (思维 + 双端队列)

首先发现且非序列只要出现0，可以直接的出结果，于是维护最后一个零的位置。

采用数组加两个指针的方式模拟双端队列

#include <bits/stdc++.h>

using namespace std;
const int maxn = 200010;
const int base = 200005;
int deq[maxn*2], l, r;
int deq2[maxn*2], l2, r2;//zero

void debug() {
    printf("deq:");
    for(int i = l + 1; i < r; ++i) {
        printf("%d", deq[base + i]);
    }
    cout << endl;
    printf("zero:");
    for(int i = l2 + 1; i < r2; ++i) {
        printf("%d", deq2[base + i]);
    }
    cout << endl;
}

int main() {

    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    int t, kase = 1;
    cin >> t;
    while(t--) {
        int q;
        cin >> q;
        l = 0, r = 1;
        l2 = 0, r2 = 1;
        bool rev = false;

        printf("Case #%d:\n", kase++);
        while(q--) {
            char op[10];
            scanf("%s", op);
            //cout << op << endl;
            if(op[2] == 'S') {
                int x;
                cin >> x;
                if(rev) {
                    deq[base + l] = x;
                    l--;
                    if(x == 0) {
                        deq2[base + l2] = l + 1;
                        l2--;
                    }
                }
                else {
                    deq[base + r] = x;
                    r++;
                    if(x == 0) {
                        deq2[base + r2] = r - 1;
                        r2++;
                    }
                }
            }
            else if(op[2] == 'P') {
                if(rev) {
                    ++l;
                    if(deq[l + base] == 0) {
                        l2++;
                    }
                }
                else {
                    --r;
                    if(deq[r + base] == 0) {
                        r2--;
                    }
                }
            }
            else if(op[2] == 'V') {
                rev = !rev;
            }
            else {
                if(r - l == 1) puts("Invalid.");
                else {
                    if(r2 - l2 == 1) {  //no zero
                        puts((r - l - 1)%2 ? "1":"0");
                    }
                    else {
                        int zero;
                        if(!rev) {
                            //puts("yes");
                            zero = deq2[l2 + 1 + base];
                            if(zero == r - 1) {
                                puts((zero - l - 1)%2 ? "1":"0");
                            }
                            else {
                                puts((zero - l - 1)%2 ? "0":"1");
                            }
                        }
                        else {
                            zero = deq2[r2 - 1 + base];
                            if(zero == l + 1) {
                                puts((r - zero - 1)%2 ? "1":"0");
                            }
                            else {
                                puts((r - zero - 1)%2 ? "0":"1");
                            }
                        }
                    }
                }
            }
            //debug();
        }
    }
    return 0;
}