题目链接:http://poj.org/problem?id=3276
题意:给你n头牛,要求你选择一个数k,使得每次只能翻转连续K个数,使得牛的脸都朝向前面且需要翻转的次数最少。
思路:vis[i]记录i是否翻转。则vis[i-k+1] + vis[i-k+2] +….+vis[i-1] 为 i 的前k个数的翻转次数,由于每次翻转都会导致i翻转。若和为奇数,则相当于 i 翻转了一次 ,偶数则为 i 未翻转。
代码:
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <ctype.h>
#include <time.h>
#include <queue>
#include <iterator>
#include <vector>
#include <set>
using namespace std;
const int MAXN = 5010;
const int inf = 100000000;
int n;
char c;
int p[MAXN];
int vis[MAXN];
int solve(int k)
{
int res = 0;
int sum = 0;
memset(vis, 0, sizeof(vis));
for (int i = 0; i + k <= n; i++)
{
if ((sum + p[i]) % 2 != 0)
{
res++;
vis[i] = 1;
}
sum += vis[i];
if (i - k + 1 >= 0)
sum -= vis[i - k + 1];
}
for (int i = n - k + 1; i<n; i++)
{
if ((sum + p[i]) % 2 != 0)
return -1;
if (i - k + 1 >= 0)
sum -= vis[i - k + 1];
}
return res;
}
int main()
{
while (scanf("%d", &n) != EOF)
{
bool ok = false;
getchar();
for (int i = 0; i<n; i++)
{
scanf("%c", &c);
if (c == 'F')
p[i] = 0;
else
{
p[i] = 1;
ok = true;
}
getchar();
}
if (!ok)
{
printf("0 0\n");
continue;
}
int ans = inf;
int pos = 1;
for (int k = 1; k <= n; k++)
{
int tmp = solve(k);
if (tmp < ans && tmp >= 0)
{
ans = tmp;
pos = k;
}
}
printf("%d %d\n", pos, ans);
}
return 0;
}