Given an arr[] of optimistic integers and begin[] and finish[] arrays of size L, Which comprises the beginning and finish indexes of L variety of non-intersecting sub-arrays as a begin[i] and finish[i]  for all (1 ≤ i ≤ L). An operation is outlined as under: 

• Choose an ordered steady or non – steady a part of the sub-array after which add an integer let’s say A to the entire parts of the chosen half.

Then, the duty is to output the minimal quantity of given operations required to make all the weather of all given non – intersecting sub-arrays distinct.

Notice: If a couple of sub-arrays comprises the identical aspect, It doesn’t matter. Simply every sub-array ought to comprise distinct parts in itself.

Examples:

Enter: arr[] = {2, 2, 1, 2, 3}, begin[] = {1, 3}, finish[] = {2, 5}               
Output: 1
Rationalization: First sub-array : [start[1], finish[1]] = {2, 2}.
Second sub-array : [start[3], finish[5]] = {1, 2, 3}.
In First sub-array selected sub-sequence from index 1 to 1 as {2} and plus any integer random integer let say 1.Then, First sub-array = {3, 2}. Now, each sub-array comprises distinct parts in itself. Whole variety of required operation are 1.

Enter: arr[] = {1, 2, 3, 3, 4, 5}, begin[] = {1, 4}, finish[] = {3, 6}
Output: 0
Rationalization: It may be verified that sub-arrays {1, 2, 3} and {3, 4, 5} each are distinct in itself. Subsequently, whole variety of required operations are 0.

Method: Implement the thought under to resolve the issue

Making all the weather distinct in a sub-array by given operation solely relies upon upon the utmost frequency in an sub-array, If we transformed excessive frequent aspect in distinct type then remainder of the frequencies lower than max frequency might be make distinct concurrently. For extra readability see the  idea of strategy.Receive the utmost frequency in every sub-array and apply the algorithm offered under.

Idea of strategy:

Suppose our sub-array A[] is = {2, 2, 2, 2, 2, 2, 2, 2, 2, 2}. Highest frequency is 10 right here.

First operation: Selected ordered sub-sequence from index 6 to 10 and add any integer let say 1 to all parts in sub-sequence. Then,   A[] = {2, 2, 2, 2, 2, 3, 3, 3, 3, 3}. Highest frequency is 5 until right here. 

Second Operation: Selected ordered sub-sequence from index 3 to five and eight to 10 add any integer let say 2 to all parts in sub-sequence. Then,  A[] = {2, 2, 4, 4, 4, 3, 3, 5, 5, 5}. Highest frequency is 3 until right here.

Third Operation: Selected ordered sub-sequence from index 4 to five and 9 to 10 add any integer let say 3 to all parts in sub-sequence. Then,  A[] = {2, 2, 4, 7, 7, 3, 3, 5, 8, 8}

Fourth Operation: Selected ordered sub-sequence of indices : {1, 4, 6, 9}  add any integer let say 10 to all parts in sub-sequence. Then,  A[] = {12, 2, 4, 17, 7, 13, 3, 5, 18, 8}

Thus, Solely 4 operation are required to transform into distinct parts. At second operation we are able to see the each 2 and three aspect has 5 frequency and we efficiently convert them into distinct parts. This provides us concept that If we attempt to make max frequent aspect distinct, Then remainder of the weather having frequency lower than or equal to max frequency might be transformed into distinct concurrently.    

In above instance, It may be clearly seen that, At every operation we’re changing the precisely half of the parts, If worth of max_frequency is even at that present operation in any other case we’re changing (max_frequency+1)/2 parts in addition to we’re decreasing the worth of max_frequency in the identical method.Thus we are able to conclude the under offered algorithm to resolve the issue.

Algorithm to resolve the issue:

      1. Create a variable let’s say min_operations to retailer whole variety of minimal operations required for all              sub-arrays.

      2. For Every given sub-array observe the steps under:

•  Depend frequency of every aspect and retailer them in Hash-Map.
• Traverse the Hash-Map to acquire most frequency in a variable let’s say max_frequency.
• Create and initialize counter variable to zero.
• Apply the under algorithm for acquiring minimal variety of operations required.   

            whereas(max_frequency > 1)
              {
                      if (isEven(max_frequency))
                       {
                             max_frequency/=2;
                        }
                      else
                       {
                             max_frequency = (max_frequency+1)/2;
                       }
                      counter++;
             }

• On finishing the loop add worth of counter variable in min_operations.

      3. After apply above algorithm on every given sub-array print the worth of min_operations.  

Beneath is the code to implement the strategy:

Time Complexity: O(N)
Auxiliary House: O(N)