P1209 [USACO1.3]修理牛棚 Barn Repair
2017-02-11 22:27
441 查看
题目描述
所有的牛棚有相同的宽度。木材供应商将会供应他任何他想要的长度,但是只能提供有限数目的木板。将他购买的木板总长度减到最少。
样例输入
4 50 18 3 4 6 8 14 15 16 17 21 25 26 27 30 31 40 41 42 43
样例输出
25
思路
将有牛的牛棚按编号排序后可以枚举模板间隔k,来使相邻两块有牛牛棚链接,并标记,直到所用木板数等于m,此时所填的间隙大小加上带有牛的牛棚数量即为答案。 O(n)
var tot,n,ans:longint; a,b:array[0..2000] of longint; procedure qsort(l,r:longint); var i,j,x,t:longint; begin if l>=r then exit; i:=l;j:=r; x:=a[l+random(r-l)]; repeat while a[i]>x do inc(i); while a[j]<x do dec(j); if i<=j then begin t:=a[i];a[i]:=a[j];a[j]:=t; inc(i);dec(j); end; until i>j; qsort(l,j); qsort(i,r); end; procedure init; var i,min,max:longint; begin readln(tot,n,n); min:=maxlongint;max:=0; for i:=1 to n do begin readln(a[i]); if a[i]<min then min:=a[i]; if a[i]>max then max:=a[i]; end; ans:=max-min; end; procedure main; var i:longint; begin for i:=2 to n do b[i]:=abs(a[i]-a[i-1]); a:=b; qsort(2,n); if tot>=n then tot:=n; for i:=2 to 2+tot-2 do dec(ans,a[i]); writeln(ans+tot); end; begin randomize; init; qsort(1,n); main; end.
相关文章推荐
- 洛谷——P1209 [USACO1.3]修理牛棚 Barn Repair
- 【贪心】洛谷 P1209 [USACO1.3]修理牛棚 Barn Repair
- P1209 [USACO1.3]修理牛棚 Barn Repair
- 洛谷P1209 [USACO1.3]修理牛棚 Barn Repair
- 洛谷 P1209 [USACO1.3]修理牛棚 Barn Repair
- 洛谷P1209 [USACO1.3]修理牛棚 Barn Repair
- 洛谷P1209 [USACO1.3]修理牛棚 Barn Repair
- USACO1.3 修理牛棚 Barn Repair
- USACO1.3 修理牛棚 Barn Repair
- Usaco 1.3.2 修理牛棚(Barn Repair)
- Usaco 1.3.2 修理牛棚(Barn Repair)
- USACO 修理牛棚 Barn Repair
- USACO section1.3 Barn Repair 修理牛棚(贪心)
- 【动态规划】Barn Repair 修理牛棚 (Usaco_Training 1.3)
- USACO: Section 1.3 -- PROB Barn Repair
- 【动态规划】[luoguP1209 USACO1.3]修理牛棚 Barn Repair
- USACO 1.3 - Barn Repair(贪心)
- usaco 1.3 barn repair...有意思...
- 【动态规划】Barn Repair 修理牛棚 (Usaco_Training 1.3)
- 修理牛棚 Barn Repair【USACO1.3】(提高组)