Company: Netcore
Difficulty: medium
Treasure Division 2 After working for days and nights together, you and Bob finally find the treasure of the ancient civilization. After counting all the treasures, you find that out of 10 9 treasures, only a few unique n number of treasures have a value of more than 1. Every other treasure id has a value of just 1. Each treasure is assigned an id (denoting the treasure number) and a value (denoting the value of the treasure). You and Bob decide to divide the treasure as follows: Bob chooses a length of interval k . You choose an id x and take all the treasures from x to x + k - 1 . You are quite greedy and want to take the maximum value of the treasure that you can take. Return the maximum value of the treasure that you can take and the index x . If there are many possible values of index x , return the lowest value of all those indexes. Input Format An integer n represents the number of unique treasures. An integer k represents the length of the interval. An array of size n represent