Codeforces Round #334 (Div. 2) C. Alternative Thinking
2016-01-09 21:05
351 查看
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
output
input
output
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.
解题报告:Codeforces
Round #334 Editorial
题意:给你一个长度是n的01序列,然后你可以选择一个非空子串
,进行反转操作,0变1,1变为0(只能操作以次),
最后能形成的最长的交替序列,一共有多长。
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.
解题报告:Codeforces
Round #334 Editorial
题意:给你一个长度是n的01序列,然后你可以选择一个非空子串
,进行反转操作,0变1,1变为0(只能操作以次),
最后能形成的最长的交替序列,一共有多长。
相关文章推荐
- spi子系统 赏析
- Atom的view框架2-SpacePenViews
- 木兰花
- Codeforces Round #334 (Div. 2) B. More Cowbell
- 上传编辑头像
- struct 结构体笔记
- python numpy:1 numpy.array和numpy.matrix常用函数使用
- Linux time()函数解析
- <LeetCode OJ> 47. Permutations II
- 自定义SSLSocketFactory
- Codeforces Round #338 (Div. 2) 615B Longtail Hedgehog(dp)
- C++中的new/delete运算符与operator new/operator delete函数
- 将自己的rest web app 从内网发布到外网
- 12 蛇形打印矩阵中的数据
- SpringMVC在做静态资源映射的时候需要注意的问题
- Sicily 1500. Prime Gap
- Codeforces Round #338 (Div. 2) C. Running Track 字符串处理
- C++入门(12):高级OOP技术:重载操作符、多继承和虚继承
- 使用包含预定义动作的隐式Intent
- Ruby环境搭建