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

 

09..

 

There are N frogs (numbered 1 through N) in a line. For each valid i, the i-th frog is initially at the position i, it has
weight Wi, and whenever you hit its back, it jumps a distance Li to the right, i.e. its position increases by Li. The
weights of the frogs are pairwise distinct.
You can hit the back of each frog any number of times (possibly zero, not necessarily the same for all frogs) in any
order. The frogs do not interfere with each other, so there can be any number of frogs at the same time at each
position.
Your task is to sort the frogs in the increasing order of weight using the smallest possible number of hits. In other
words, after all the hits are performed, then for each pair of frogs (i, j) such that Wi<Wj, the position of the i-th
frog should be strictly smaller than the position of the j-th frog. Find the smallest number of hits needed to achieve
such a state.
Test Case:
1
3
312
145
Output:
3
Transcribed Image Text:There are N frogs (numbered 1 through N) in a line. For each valid i, the i-th frog is initially at the position i, it has weight Wi, and whenever you hit its back, it jumps a distance Li to the right, i.e. its position increases by Li. The weights of the frogs are pairwise distinct. You can hit the back of each frog any number of times (possibly zero, not necessarily the same for all frogs) in any order. The frogs do not interfere with each other, so there can be any number of frogs at the same time at each position. Your task is to sort the frogs in the increasing order of weight using the smallest possible number of hits. In other words, after all the hits are performed, then for each pair of frogs (i, j) such that Wi<Wj, the position of the i-th frog should be strictly smaller than the position of the j-th frog. Find the smallest number of hits needed to achieve such a state. Test Case: 1 3 312 145 Output: 3
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Public key encryption
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