Place k elements such that minimum distance is maximized

Given an array representing n positions along a straight line. Find k (where k <= n) elements from the array such that the maximum distance between any two (consecutive points among the k points) is maximized.

Input : arr[] = {1, 2, 8, 4, 9}
            k = 3
Output : 3
Largest minimum distance = 3
3 elements arranged at positions 1, 4 and 8, 
Resulting in a minimum distance of 3

Input  : arr[] = {1, 2, 7, 5, 11, 12}
             k = 3
Output : 5
Largest minimum distance = 5
3 elements arranged at positions 1, 7 and 12, 
resulting in a minimum distance of 5 (between
7 and 12)

A Naive Solution is to consider all subsets of size 3 and find minimum distance for every subset. Finally return the largest of all minimum distances.

An Efficient Solution is based on Binary Search. We first sort the array. Now we know maximum possible value result is arr[n-1] – arr[0] (for k = 2). We do binary search for maximum result for given k. We start with middle of maximum possible result. If middle is a feasible solution, we search on right half of mid. Else we search is left half. To check feasibility, we place k elements under given mid distance.

// C++ program to find largest minimum distance
// among k points.
#include <bits/stdc++.h>
using namespace std;

// Returns true if it is possible to arrange
// k elements of arr[0..n-1] with minimum distance
// given as mid.
bool isFeasible(int mid, int arr[], int n, int k)
    // Place first element at arr[0] position
    int pos = arr[0];

    // Initialize count of elements placed.
    int elements = 1;

    // Try placing k elements with minimum
    // distance mid.
    for (int i=1; i<n; i++)
        if (arr[i] - pos >= mid)
            // Place next element if its
            // distance from the previously
            // placed element is greater
            // than current mid
            pos = arr[i];

            // Return if all elements are placed
            // successfully
            if (elements == k)
              return true;
    return 0;

// Returns largest minimum distance for k elements
// in arr[0..n-1]. If elements can't be placed,
// returns -1.
int largestMinDist(int arr[], int n, int k)
    // Sort the positions

    // Initialize result.
    int res = -1;

    // Consider the maximum possible distance
    int left = arr[0], right = arr[n-1];

    // Do binary search for largest minimum distance
    while (left < right)
        int mid = (left + right)/2;

        // If it is possible to place k elements
        // with minimum distance mid, search for
        // higher distance.
        if (isFeasible(mid, arr, n, k))
            // Change value of variable max to mid iff
            // all elements can be successfully placed
            res = max(res, mid);
            left = mid + 1;

        // If not possible to place k elements, search
        // for lower distance
            right = mid;

    return res;

// Driver code
int main()
    int arr[] = {1, 2, 8, 4, 9};
    int n = sizeof(arr)/sizeof(arr[0]);
    int k = 3;
    cout << largestMinDist(arr, n, k);
    return 0;



This article is contributed by Raghav Jajodia. If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Writing code in comment? Please use, generate link and share the link here.