题目链接:
http://codeforces.com/problemset/problem/1025/C
题目:
Is there anything better than going to the zoo after a tiresome week at work? No wonder Grisha feels the same while spending the entire weekend accompanied by pretty striped zebras.
Inspired by this adventure and an accidentally found plasticine pack (represented as a sequence of black and white stripes), Grisha now wants to select several consequent (contiguous) pieces of alternating colors to create a zebra. Let's call the number of selected pieces the length of the zebra.
Before assembling the zebra Grisha can make the following operation 00 or more times. He splits the sequence in some place into two parts, then reverses each of them and sticks them together again. For example, if Grisha has pieces in the order "bwbbw" (here 'b' denotes a black strip, and 'w' denotes a white strip), then he can split the sequence as bw|bbw (here the vertical bar represents the cut), reverse both parts and obtain "wbwbb".
Determine the maximum possible length of the zebra that Grisha can produce.
Input
The only line contains a string ss (1≤|s|≤1051≤|s|≤105, where |s||s| denotes the length of the string ss) comprised of lowercase English letters 'b' and 'w' only, where 'w' denotes a white piece and 'b' denotes a black piece.
Output
Print a single integer — the maximum possible zebra length.
Examples
input
Copy
bwwwbwwbw
output
Copy
5
input
Copy
bwwbwwb
output
Copy
3
Note
In the first example one of the possible sequence of operations is bwwwbww|bw →→ w|wbwwwbwb →→ wbwbwwwbw, that gives the answer equal to 55.
In the second example no operation can increase the answer.
题目大意:
有一个由‘w’和‘b’组成字符串,你可以把这个字符串分成两个部分,然后分别翻转,次数不限(比如bw|bbw (‘|’代表分割线), 翻转之后变成 "wbwbb".)。问你连续的‘w’ ‘b’ 交替出现的最长长度是多少。
分析:
我们观察这个操作的特点,发现其实就像相当于把这个串的首尾相连,然后在分隔处截断。也就是说,如果我们把这个字符串看成首尾相连的一个环,那么,不管怎么操作,这些字母的相对位置都是不会改变的,也就是说,我们直接统计这个环里面的最长交替出现的长度即可。
至于怎么把它看成一个环,我是把数组在数组的末尾又复制了一遍,但是这样如果这个字符串都是交替出现的话,结果会比n大哦,所以需要特判一下。
代码:
#include <bits/stdc++.h>
using namespace std;
const int MAXN=(int)1e5+10;
char s[MAXN<<1];
int main()
{
scanf("%s",s);
int len=strlen(s);
memcpy(s+len,s,len*sizeof(char));
len<<=1;
int ans=1;
for(int i=1;i<len;i++)
{
int tlen=1;
while(s[i]!=s[i-1]&&i<len)
tlen++,i++;
ans=max(ans,tlen);
}
len>>=1;
printf("%d\n",min(ans,len));
return 0;
}