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.

Examples

input

8
10000011

output

5

input

2
01

output

2

dp[i]表示从字符串i开始01的对数

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#define maxn 100005
#define MOD 1000000007
using namespace std;
typedef long long ll;

char str[maxn];
int dp[maxn];
int main(){
	//freopen("in.txt", "r", stdin);
	int n, p = 0, k = 0;
	scanf("%d%s", &n, str);
	for(int i = n - 2; i >= 0; i--){
		if(str[i] != str[i+1]){
		 dp[i] = dp[i+1] + 1;
		 k++;
	    }
		else{
			dp[i] = k + 1;
			if(p)
			 dp[i]++;
			p = 1;
		}
	}
	cout << dp[0] + 1 << endl;
	return 0;
}