codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

603A.md (2214B)


      1 Source: https://codeforces.com/problemset/problem/603/A
      2 
      3 A. Alternative Thinking
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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.
     24 
     25 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.
     26 
     27 Input
     28 
     29 The first line contains the number of questions on the olympiad *n* (1 ≤ *n* ≤ 100 000).
     30 
     31 The following line contains a binary string of length *n* representing Kevin's results on the USAICO.
     32 
     33 Output
     34 
     35 Output a single integer, the length of the longest possible alternating subsequence that Kevin can create in his string after flipping a single substring.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 8  
     43 10000011
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 5
     50 ```
     51 
     52 Input
     53 
     54 ```
     55 2  
     56 01
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 2
     63 ```
     64 
     65 Note
     66 
     67 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'.
     68 
     69 In the second sample, Kevin can flip the entire string and still have the same score.