Given an input array A, your goal is to decide which stores to open, choosing among the values of i for which A[i] = 1. The only condition you must meet is that each pair of stores must be separated by at least three blocks. In other words, if you open stores on blocks x and y, then y − x ≥ 3. Your goal is to open as many stores as possible. For example, if n = 16 and A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0], then the optimal solution is to open stores on blocks i = 2, 6, 10, 13, as illustrated in bold: A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]. Provide a greedy algorithm to solve this problem. Clearly explain how your algorithm works, why the running time of your algorithm is O(n), and show that the output is guaranteed to maximize the number of opened stores.
Given an input array A, your goal is to decide which stores to open, choosing among the values of i for which A[i] = 1. The only condition you must meet is that each pair of stores must be separated by at least three blocks. In other words, if you open stores on blocks x and y, then y − x ≥ 3. Your goal is to open as many stores as possible. For example, if n = 16 and A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0], then the optimal solution is to open stores on blocks i = 2, 6, 10, 13, as illustrated in bold: A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0]. Provide a greedy algorithm to solve this problem. Clearly explain how your algorithm works, why the running time of your algorithm is O(n), and show that the output is guaranteed to maximize the number of opened stores.
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
Related questions
Question
Given an input array A, your goal is to decide which stores to open, choosing among the values of i for which A[i] = 1. The only condition you must meet is that each pair of stores must be separated by at least three blocks. In other words, if you open stores on blocks x and y, then y − x ≥ 3.
Your goal is to open as many stores as possible.
For example, if n = 16 and A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0], then the optimal solution is to
open stores on blocks i = 2, 6, 10, 13, as illustrated in bold:
A = [0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0].
Provide a greedy
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education