poj 3253 Fence Repair
2016-05-10 17:41
429 查看
Fence Repair
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤
50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made;
you should ignore it, too.
FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.
Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will
result in different charges since the resulting intermediate planks are of different lengths.
Input
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
Sample Output
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into
16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).
题意:
将一个长度为L的木板分成n个长度的小木板
每次切木板时开销为大木板的长度
比如长度为21的木板切成5,8,8,时
21->13,8 开销为21
13->5,8 开销是13
总开销为:21+13=34
求最小开销
思路:
只需每次取出最短的两块,并把两块长度之和加到集合中
直到集合中剩下一个木板为止
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 37649 | Accepted: 12210 |
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤
50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made;
you should ignore it, too.
FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.
Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will
result in different charges since the resulting intermediate planks are of different lengths.
Input
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
3 8 5 8
Sample Output
34
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into
16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).
题意:
将一个长度为L的木板分成n个长度的小木板
每次切木板时开销为大木板的长度
比如长度为21的木板切成5,8,8,时
21->13,8 开销为21
13->5,8 开销是13
总开销为:21+13=34
求最小开销
思路:
只需每次取出最短的两块,并把两块长度之和加到集合中
直到集合中剩下一个木板为止
#include <queue> #include <cstdio> #include <cstring> #include <iostream> using namespace std; priority_queue<int,vector<int>,greater<int> > q; int main(){ long long s; int i,n,k,u,v; while(~scanf("%d",&n)){ while(!q.empty()) q.pop(); while(n--){ scanf("%d",&k); q.push(k); } s=0; while(q.size()>1){ u=q.top(); q.pop(); v=q.top(); q.pop(); s+=u+v; q.push(u+v); } cout<<s<<endl; } return 0; }
相关文章推荐
- JavaScript根据CSS的Media Queries来判断浏览设备的方法
- javascript学习之Function 类型
- javascript学习之Function 类型
- JQuery插件--什么?你还不会写JQuery 插件
- jquery禁止复制、禁用右键、文本选择功能、复制按键
- angularjs学习总结一(表达式、指令、模型)
- RxJS入门(9)----调度(Bending Time with Schedulers)
- javaScript 常用方法
- JavaScript中的原型prototype完全解析
- Hadoop 2.3.0-cdh5.0.0 HA集群搭建(yum 安装)
- Qt样式表的使用
- 进度条样式
- Jscript运行时错误:没有权限
- 百度地图api for js 优化
- JS+JQuery实现前端省、市、区三级联动(插件)
- jQuery Mobile 表单
- [自动化平台系列] - 初次使用 Macaca-前端自动化测试(1)
- 怎么阻止直接输入地址访问 html 页面
- AngularJS directive指令之require部分
- javascript:history.go()和History.back()的区别及应用