Section1.3-Barn Repair

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

 

 

本题考查贪心思想：

 用len[i][j]来表示用j块板子覆盖i个牛棚格子的板子的最小总长度。

 

初始化len[0][0]=1，然后不断递推。

 

tips：

1.程序中初始化的时候用了memset(len,'#',sizeof(len)); 这是因为len是二维数组，如果写成memset(len,0,sizeof(len));并不能达到你所需要的初始化全为0的效果，这是由于memset函数的按字节初始化的缘故。也可以写成memset(len,0x1f,sizeof(len));。

2.第一层循环i从1开始。

 

代码：

 1 /*
 2 ID:pekingt1
 3 TASK:barn1
 4 LANG:C++
 5 */
 6 #include<iostream>
 7 #include<cstdio>
 8 #include<cstring>
 9 #include<algorithm>
10 using namespace std;
11 const int maxn=205;
12 int len[maxn][maxn];
13 int unit[maxn];
14 
15 #define MIN(a,b) ((a<b)? a:b)
16 
17 bool cmp(int a,int b){return a<b;}
18 
19 int main()
20 {
21     freopen("barn1.in","r",stdin);
22     freopen("barn1.out","w",stdout);
23     int M,S,C;
24     while(scanf("%d%d%d",&M,&S,&C)!=EOF)
25     {
26         int minnum=(int)(2e9);
27 
28         memset(len,'#',sizeof(len));
29 
30         for(int i=0;i<C;i++)
31             cin>>unit[i];
32         sort(unit,unit+C,cmp);
33 
34         len[0][0]=1;
35         for(int i=1;i<C;i++)
36         {
37             for(int j=0;j<=i&&j<M;j++)
38             {
39                 len[i][j]=len[i-1][j]+(unit[i]-unit[i-1]);
40                 if(j>0)
41                     len[i][j]=MIN(len[i][j],len[i-1][j-1]+1);
42                 if(i==C-1)
43                     minnum=MIN(minnum,len[i][j]);
44             }
45         }
46         cout<<minnum<<endl;
47     }
48     return 0;
49 }

 

转载于:https://www.cnblogs.com/hongyang/articles/4640517.html