codeforces 1025 C 字符串翻转

C. Plasticine zebra

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 5 .

In the second example no operation can increase the answer.

 

数量级为1e5，就CF来说肯定有简单的方法来处理这个地方，或者公式规律等，这道题是一种特殊的方法，拿样例bwwwbwwbw来说，你需要将其翻转得到一个新的字符串，比如bww | wbwwbw-->wwbwbwwbw,其实这样就已经得到了我们需要的子串wbwbw长度为5，不管怎么转换翻转，你得到的都是wbwbw这个串，你会发现转换之后字符串首尾会连接起来，还是原来的相对顺序，对于成环的字符，我们可以将其扩展成两倍的字符串，这是普遍的一种方法。

#include<bits/stdc++.h>
using namespace std;
const int _=1e6;
char a[_];
int n;
int main(){
	scanf("%s",a+1);
	n=strlen(a+1);
	for(int i=1;i<=n;++i)a[i+n]=a[i];
	int ans=0,s=0;
	for(int i=1;i<=n*2;++i){
		if(a[i]!=a[i-1])s++;
		else s=1;
		ans=max(s,ans);
	}
	cout<<min(ans,n)<<endl;//这里要注意最长的长度是不会长过字符串本身的
}