【动态规划】Barn Repair 修理牛棚 (Usaco_Training 1.3)

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

 

[ 一种最优的安排是用板拦牛棚3-8,14-21,25-31,40-43.]

 

 

这一题方法很多了，可以假设全部都单独用一个木板，然后依次找最小的间隙进行合并，一直到间隙<n的时候去找最小值

当然还可以用动态规划来做，用f[i][j]表示用第 i 块木板搭建到第 j 个牛棚所能达到的最小总长度

f[i][j]=max(f[i-1][j-1]+1,f[i][j-1]+a[j]-a[j-1]);

 

C++ Code

/*
ID: jiangzh15
TASK: barn1
LANG: C++
*/
//   http://oijzh.cnblogs.com
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAXN 200
#define INF 0x7fffffff

int n,s,c,a[MAXN],f[60][MAXN];

int main()
{
    freopen("barn1.in","r",stdin);
    freopen("barn1.out","w",stdout);
    scanf("%d%d%d",&n,&s,&c);
    int i;
    for(i=1;i<=c;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+1+c);
    memset(f,63,sizeof(f));
    f[0][0]=0;
    for(i=1;i<=n;i++)
        for(int j=1;j<=c;j++)
        {
            if(i>0&&j>0)f[i][j]=min(f[i][j],f[i-1][j-1]+1);
            if(j>0)f[i][j]=min(f[i][j],f[i][j-1]+a[j]-a[j-1]);
        }
    int minp=INF;
    for(i=1;i<=n;i++) minp=min(minp,f[i][c]);
    printf("%d\n",minp);
    return 0;
}

 

 

转载于:https://www.cnblogs.com/oijzh/archive/2012/10/10/2719033.html