http://www.luogu.org/problem/show?pid=1203
按题意模拟即可
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define ms(i,j) memset(i,j, sizeof i);
using namespace std;
char ch[1000];
int main()
{
int n;
scanf("%d\n", &n);
for (int i=1;i<=n;i++)
{
ch[i]=getchar();
}
int ans = 0;
for (int i=1;i<=n;i++)
{
int t = 0;
int a = i+1, b = i;
if (a>n) a=1;
if (b<=0) b=n;
int e = a,q = b;
while (!(ch[a]!=ch[e]&&ch[b]!=ch[q]) ||(ch[a]=='w'||ch[b]=='w'))
{
if (a==b) {t++;break;}
if (ch[a]==ch[e]||ch[a]=='w') {a++;t++;}
if (ch[b]==ch[q]||ch[b]=='w') {b--;t++;}
if (a>n) a=1;
if (b<=0) b=n;
}
ans = max(t,ans);
}
printf("%d\n", ans);
return 0;
}