### dunjen_master's blog

By dunjen_master, history, 16 months ago,

You are given an array consisting of N elements. You can perform two operations any no. of times. 1. Make any even element E = E/2. and 2. Make any odd element E = 2E.

You have to minimize the maximum absolute difference between any two elements

For ex- N=2 {1,2}

We can make 2--> 2/2 = 1 Thus answer = 0

• +12

 » 16 months ago, # |   0 What constraints for N?
•  » » 16 months ago, # ^ |   0 100 test cases and 50000 maximum no of elements
 » 16 months ago, # |   0 for each N there are maximum log2(N)+1 number possible.insert it in a set and keep track of minimum and maximum
•  » » 16 months ago, # ^ |   0 Can you please, elaborate with some pseudo code.
 » 16 months ago, # |   0 At least wait for the contest to be over before asking the solution.
•  » » 16 months ago, # ^ |   0 I thought everybody would have different problems in their set. It was a 1.5 hour test which I have already submitted.
•  » » » 16 months ago, # ^ |   0 But where is the contest?
•  » » » » 16 months ago, # ^ |   0 It is the hackerearth problem setting contest.
 » 14 months ago, # |   0 Can anyone please explain the approach of this question
 » 2 months ago, # |   0 Can someone help me with the approach to this problem?
•  » » 2 months ago, # ^ |   +3 Every no. has 2 states, odd or even. Let's make all no.s odd. Sort the array. Now you can clearly see that the ans would be minimum if we make first few elements of the array even and others as it is. You can check for each case.