Codeforces Round #334 (Div. 2) 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 anot-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.

Sample test(s)

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.

题意：给你一个长度为n的01串，对[i,j]区间内的数翻转（1变为0,0变为1）。求翻转后 最长的01相隔的子序列的长度是多少？

情况一：加2

xx...yy（比如1101011，01相隔的子序列的长度为5，...表示01相隔的子序列） 

翻转后得到最大的结果

xy...xy(10...10，01相隔的子序列的长度为5+2)

情况二：加0

xyxy...xy（比如01010101，01相隔的子序列的长度为8）

翻转后得到最大的结果

yxyx...yx（10101010，01相隔的子序列的长度为8）

情况三：加1

xx...（比如110101，01相隔的子序列的长度为5）

或者

...yy（比如0101011，01相隔的子序列的长度为6）

翻转后得到最大的结果

xy...（101010，01相隔的子序列的长度为6）

或者

...xy（1010101，01相隔的子序列的长度为7）

#include
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
#include
             
             
              
              
using namespace std;

const int N = 100010;
char str[N];

int main(void)
{
    int n;
    int i, j;
    while(~scanf("%d%s", &n, str))
    {
        int len = strlen(str);
        char flag = '1';
        int ans = 1;
        if(str[0] == '0') flag = '0';
        for(i = 1; i < len; i++)
        {
            if(str[i] != flag)
            {
                if(flag == '0') flag = '1';
                else flag = '0';
                ans ++;
            }
        }
        for(i = 0; i+1 < len; i++)
        {
            if(str[i] == str[i+1])
            {
                for(i = i+1; i+1 < len; i++)
                {
                    if(str[i] == str[i+1]) break;
                }
                if(i+1 < len) ans += 2;
                else ans++;
                break;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}