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.]
又来做usaco,前面写的题目都没有保存下代码,从这道开始记录下。
简单贪心,题意大概是说有m个木板,s个牛棚,c头牛,每个牛棚只有一只牛,问最短的木板把有牛的牛棚给拦住。
首先有牛的牛棚自然要拦住,但是只有m个木板,所以肯定要拦住一些没有牛的牛棚才能凑得出m个。
看样例,用四块木板,不算头尾的空缺(3-43),只有三个(m-1)空缺。
把所有空缺枚举出来,做个排序,然后从小到大加入这些空缺,直到满足三个(m-1)。
#include<stdio.h>
#include<stdlib.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;
#define LL long long
#define INF 999999999
const int maxn = 100009;
main()
{
freopen("barn1.in","r",stdin);
freopen("barn1.out","w",stdout);
int n,i,j,m,c,s,sum=0,b[9999];
scanf("%d %d %d",&m,&s,&c);
int a[9999]={0},max=0;
for(i=1;i<=c;i++)
{
scanf("%d",&j);
a[j]=1;
if(j>max)max=j;
}
s=max;
i=1;
while(a[i]==0)
i++;
for(j=1;i<=s;i++)
if(a[i]==0)
{
sum=0;
while(a[i]==0)
sum++,i++;
b[j]=sum,j++;
}
n=j-1;
sort(b+1,b+j);
int ans=0;
for(i=1;i<=s;i++)
ans=ans+a[i];
for(j=1;j<=n-m+1;j++)
ans=ans+b[j];
printf("%d\n",ans);
return 0;
//system("pause");
}