Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question

@123 SO VALIYA 34.

 

There are N frogs (numbered I through N) in a line. For each valid 1, the 1-th frog is initially at the position 1, 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
expand button
Transcribed Image Text:There are N frogs (numbered I through N) in a line. For each valid 1, the 1-th frog is initially at the position 1, 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
Check Mark
Knowledge Booster
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY