POJ 3276 —— Face The Right Way

题目来源：http://poj.org/problem?id=3276

类似尺取法，不过需要优化到O(n^2)。用一个c记录该位置被翻转的次数。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#define ll long long
using namespace std;
int n;
const int maxn=1e4+10;
int a[maxn],b[maxn],c[maxn];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    char s;
    while (cin >> n) {
        for (int i = 1; i <= n; ++i) {
            cin >> s;
            if (s == 'B')a[i] = 1;
            else a[i] = 0;
        }
        int ansm = 1e9, ansk = 1e9;
        for (int k = 1; k <= n; ++k) {
            memset(c, 0, sizeof(c));
            for (int i = 1; i <= n; ++i)b[i] = a[i];
            int tot = 0;
            for (int i = 1; i <= n - k + 1; ++i) {
                c[i] = (c[i] + c[i - 1]) % 2;
                b[i] += c[i];
                b[i] %= 2;
                if (b[i] == 1) {
                    tot++;
                    b[i] = 0;
                    c[i + 1]++;
                    c[i + k]++;
                }
            }
            bool ok = 1;
            for (int i = n - k + 2; i <= n; ++i) {
                c[i] = (c[i] + c[i - 1]) % 2;
                b[i] += c[i];
                b[i] %= 2;
                if (b[i] == 1)ok = 0;
            }
            if (ansm > tot && ok) {
                ansm = tot;
                ansk = k;
            }
        }
        cout << ansk << ' ' << ansm << endl;
    }
    return 0;
}