John's barn has a fence consisting of N consecutive sections numbered from left to right from 1 to N. Each part is first painted in one of two colors: red or green, your information is given with string C. The color of the I-th part Ci will be equal to 'R' if the color of the part is red and 'G' if it is green. John decided to paint the whole fence green. To make the normal drawing process more fun he decided to do it using the following process. Every minute (until the whole fence is painted green) you will do the following steps: Select any part of the phone that is painted red. Let's show the index of this section as X. In each section with references X, X + 1, ., min (N, X + K - 1), flip the color of the corresponding part from red to green and from green to red by re-painting. John wonders how quickly he can paint the phone. Please help her find the minimum number of minutes needed to repaint.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Answer in C++ Only Solution:
John's barn has a fence consisting of N consecutive sections numbered from left to right from 1 to N.
Each part is first painted in one of two colors: red or green, your information is given with string C.
The color of the l-th part Ci will be equal to 'R' if the color of the part is red and 'G' if it is green.
John decided to paint the whole fence green. To make the normal drawing process more fun he
decided to do it using the following process. Every minute (until the whole fence is painted green)
you will do the following steps:
Select any part of the phone that is painted red. Let's show the index of this section as X.
In each section with references X, X + 1, ., min (N, X + K - 1), flip the color of the corresponding part
from red to green and from green to red by re-painting.
John wonders how quickly he can paint the phone. Please help her find the minimum number of
minutes needed to repaint.
Input:
1
73
RGGRGRG
Output:
4
Transcribed Image Text:Answer in C++ Only Solution: John's barn has a fence consisting of N consecutive sections numbered from left to right from 1 to N. Each part is first painted in one of two colors: red or green, your information is given with string C. The color of the l-th part Ci will be equal to 'R' if the color of the part is red and 'G' if it is green. John decided to paint the whole fence green. To make the normal drawing process more fun he decided to do it using the following process. Every minute (until the whole fence is painted green) you will do the following steps: Select any part of the phone that is painted red. Let's show the index of this section as X. In each section with references X, X + 1, ., min (N, X + K - 1), flip the color of the corresponding part from red to green and from green to red by re-painting. John wonders how quickly he can paint the phone. Please help her find the minimum number of minutes needed to repaint. Input: 1 73 RGGRGRG Output: 4
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Methods of StringBuilder class
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education