S 1.3 barn1 C语言

题目链接：

http://ace.delos.com/usacoprob2?a=QdKmO0PEsYT&S=barn1

 

USER: Yun Li [smilecl1]
TASK: barn1
LANG: C

Compiling...
Compile: OK

Executing...
   Test 1: TEST OK [0.000 secs, 2144 KB]
   Test 2: TEST OK [0.000 secs, 2144 KB]
   Test 3: TEST OK [0.000 secs, 2144 KB]
   Test 4: TEST OK [0.000 secs, 2144 KB]
   Test 5: TEST OK [0.000 secs, 2144 KB]
   Test 6: TEST OK [0.000 secs, 2144 KB]
   Test 7: TEST OK [0.000 secs, 2144 KB]
   Test 8: TEST OK [0.000 secs, 2144 KB]
   Test 9: TEST OK [0.000 secs, 2144 KB]
   Test 10: TEST OK [0.000 secs, 2144 KB]

All tests OK.
Your program ('barn1') produced all correct answers!  This is your
submission #6 for this problem.  Congratulations!

题目：

 
 
  
  
Barn Repair
 
 

It was a dark and stormy night that ripped the roof and gates off the stalls that hold Farmer John's cows. Happily, many of the cows were on vacation, so the barn was not completely full. 

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.] 

程序：

/*
ID: smilecl1
LANG: C
TASK: barn1
*/
/*
 * time:2012/11/19
 * EMAIL: smile_li_yun@163.com
 * NAME: LiYun
 */
 /*
  * 思路：
  * 统计出所有的空的stall，让后将空的stall按照从大到小的顺序排序；当然是所有的
  * board都用上时，stalls blocked最小。
  */
#include<stdio.h>
#define max_num 200
int cmp_big_to_small ( const void *a , const void *b )
{
    return *(int *)b - *(int *)a;
}
int cmp_small_to_big ( const void *a , const void *b )
{
    return *(int *)a - *(int *)b;
}
 int main()
 {
     FILE *fin;
     FILE *fout;
     int cow[max_num] = {0};
     int blank[max_num] = {0};
     int board_num;
     int cow_num;
     int stall_num;
     int blank_count = 0;
     int i;
     int j;
     fin = fopen("barn1.in","r");
     fout = fopen("barn1.out","w");
     fscanf(fin, "%d%d%d", &board_num, &stall_num, &cow_num);
     for (i = 0; i < cow_num; ++i)
     {
         fscanf(fin, "%d", &cow[i]);
     }
     /* 注意：这里输入的数组也需要排序 */
     qsort(cow, cow_num, sizeof(cow[0]), cmp_small_to_big);
     for ( i = 0; i < cow_num - 1; ++i )
     {
        blank[i] = cow[i + 1] -cow[i] - 1;
     }
     qsort(blank, max_num, sizeof(blank[0]), cmp_big_to_small);
     /* 把首尾的空的stall加进去，上面排序的只是中间有cow的空格 */
     for (i = 0; i < board_num - 1; ++i)
     {
        blank_count += blank[i];
     }
     blank_count += ( cow[0] - 1 ) + ( stall_num - cow[cow_num - 1] );
     fprintf(fout,"%d\n", stall_num - blank_count);
     return 0;
 }