GCJ Qualification Round 2016 B题

经典的翻饼问题，直接做：从下往上看，已翻好的饼忽略掉；从上往下，连续的已翻好的一起翻过来；整个翻过来。

/*
 * Author    : ben
 */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <functional>
#include <numeric>
#include <cctype>
using namespace std;
typedef long long LL;
char pancakes[];
bool pan[];
int pannum;

void inline flippan(int n) {
    bool *first = pan;
    bool *last = first + n;
    while ((first != last) && (first != --last)) {
        bool tmp = !(*last);
        *last = !(*first);
        *first = tmp;
        ++first;
    }
    if (n %  == ) {
        pan[n / ] = !pan[n / ];
    }
}

int work() {
    int ans = ;
    while (pannum > ) {
        while (pannum >  && pan[pannum - ]) {
            pannum--;
        }
        if (pannum <= ) {
            break;
        }
        int I = ;
        while (pan[I]) {
            I++;
        }
        if (I > ) {
            flippan(I);
            ans++;
        }
        flippan(pannum);
        ans++;
    }
    return ans;
}

int main() {
//    freopen("b.small.in", "r", stdin);
    int T;
    scanf("%d", &T);
    for (int t = ; t <= T; t++) {
        scanf(" %s", pancakes);
        pannum = strlen(pancakes);
        for (int i = ; i < pannum; i++) {
            if (pancakes[i] == '-') {
                pan[i] = ;
            } else {
                pan[i] = ;
            }
        }
        printf("Case #%d: %d\n", t, work());
    }
    return ;
}