There are several rooms in the same hall on the same side of the hall in the hotel. The distance between adjacent rooms equals 1 meter. You know which rooms are not vacant and which are. New group of tourist arrived and is waiting to check into.You want everyone to check into separate room so that the distance between the tourists' rooms would be as long as possible.
Input:First you enter the number of vacant rooms and the number of tourists
Then the vacant rooms' numbers
Output: One number- the possible maximum distance between tourists' rooms
Example:
Input:
7 4
3 6 8 12 16 21 28
Output:
7
Do not have a slightest idea how to perform that task((Maybe someone can at least think of action plan
Input:First you enter the number of vacant rooms and the number of tourists
Then the vacant rooms' numbers
Output: One number- the possible maximum distance between tourists' rooms
Example:
Input:
7 4
3 6 8 12 16 21 28
Output:
7
Do not have a slightest idea how to perform that task((Maybe someone can at least think of action plan