# Barn Repair

The cows spend the night in stalls that are arranged adjacent to each other in a long line. Some stalls have cows in them; some do not. All stalls are the same width.

Farmer John must quickly erect new boards in front of the stalls, since the doors were lost. His new lumber supplier will supply him boards of any length he wishes, but the supplier can only deliver a small number of total boards. Farmer John wishes to minimize the total length of the boards he must purchase.

Given M (1 <= M <= 50), the maximum number of boards that can be purchased; S (1 <= S <= 200), the total number of stalls; C (1 <= C <= S) the number of cows in the stalls, and the C occupied stall numbers (1 <= stall_number <= S), calculate the minimum number of stalls that must be blocked in order to block all the stalls that have cows in them.

Print your answer as the total number of stalls blocked.

### PROGRAM NAME: barn1

### INPUT FORMAT

Line 1: | M, S, and C (space separated) |

Lines 2-C+1: | Each line contains one integer, the number of an occupied stall. |

### SAMPLE INPUT (file barn1.in)

4 50 18 3 4 6 8 14 15 16 17 21 25 26 27 30 31 40 41 42 43

### OUTPUT FORMAT

A single line with one integer that represents the total number of stalls blocked.### SAMPLE OUTPUT (file barn1.out)

25[One minimum arrangement is one board covering stalls 3-8, one covering 14-21, one covering 25-31, and one covering 40-43.]

Greedy - sorting - finding maximum difference each time

Here you have a problem that you have C numbers and you want to split them in M-1 places so remains M sequences that the sum of the difference between the first and last number is each sequence becomes minimum.

For example something like this :

a1 a2 a3 ..... aC

you have to split this sequence in M-1 places so that :

aK1-a1+1 + aK3-aK2+1 + aK4-aK3+1 + ..... + aC-aKM-1 +1 is minimized.

First you have to sort the numbers. Then each time you have to find the maximum difference between two adjacent numbers and choose it to be the index you want to split your sequence. Do this M-1 times and then you have M sequences that the sum of the differences between the first and last number in each sequence is minimum.

## No comments:

## Post a Comment