Codeforces Round #334 (Div. 2) C. Alternative Thinking（规律+贪心）

传送门：C. Alternative Thinking

描述：

C. Alternative Thinking

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olympiad—'1' for a correctly identified cow and '0' otherwise.

However, all is not lost. Kevin is a big proponent of alternative thinking and believes that his score, instead of being the sum of his points, should be the length of the longest alternating subsequence of his string. Here, we define an alternating subsequence of a string as a not-necessarily contiguous subsequence where no two consecutive elements are equal. For example, {0, 1, 0, 1},{1, 0, 1}, and {1, 0, 1, 0} are alternating sequences, while {1, 0, 0} and {0, 1, 0, 1, 1} are not.

Kevin, being the sneaky little puffball that he is, is willing to hack into the USAICO databases to improve his score. In order to be subtle, he decides that he will flip exactly one substring—that is, take a contiguous non-empty substring of his score and change all '0's in that substring to '1's and vice versa. After such an operation, Kevin wants to know the length of the longest possible alternating subsequence that his string could have.

Input

The first line contains the number of questions on the olympiad n (1 ≤ n ≤ 100 000).

The following line contains a binary string of length n representing Kevin's results on the USAICO.

Output

Output a single integer, the length of the longest possible alternating subsequence that Kevin can create in his string after flipping a single substring.

Examples

input

8
10000011

output

5

input

2
01

output

2

Note

In the first sample, Kevin can flip the bolded substring '10000011' and turn his string into '10011011', which has an alternating subsequence of length 5: '10011011'.

In the second sample, Kevin can flip the entire string and still have the same score

题意： 

给你一个01字符串，你必须翻转其中的一个子串，问执行该操作后该字符串的最长交替子序列长度为多少？ 

思路：

首先显然翻转整个字符串该字符串的01子序列长度不变，所以最次也是不变不会减小 
显然交替子序列的个数最多增加两个，我们定义"00"，"11"这样的字符串叫做对。发现只要字符串中有两个对出现，无论何种情况，子序列的长度就一定能增加两个。如果只有一个对出现子序列长度就一定能够增加1个。所以只需要统计其中对的个数就好了。  可以举些例子找找规律~

代码：

#include <bits/stdc++.h>
using  namespace  std;
const int N=1e5+10;


int n;
char s[N];

int  main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  while(cin>>n){
    cin>>s;
    int ans=1,cnt=0;
    for(int i=1; i<n; i++){
      if(s[i]!=s[i-1])ans++;
      else cnt++;
    }
    ans+=min(cnt, 2);
    cout<<ans<<endl;
  }
  return 0;
}