Fence Repair
来源:互联网 发布:seven eleven 网络语 编辑:程序博客网 时间:2024/06/02 07:10
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.
Lines 2.. N+1: Each line contains a single integer describing the length of a needed plank
3858
34
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).
这道题要用到优先队列,用最小堆依次获得最短两块木板(贪心)则这两块木板是由同一块木板切割而成的,向上回溯直到优先队列为空
#include<cstdio>#include<algorithm>#include<queue>using namespace std;int main(){int n,i,an,min1,min2,mix;long long int rul;rul=0;priority_queue <int,vector<int>,greater<int> > q;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&an);q.push(an);}while(1){min1=q.top();q.pop();min2=q.top();q.pop();mix=min1+min2;rul+=mix;if(q.empty())break;q.push(mix);}printf("%lld",rul);return 0;}
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- CSS规范
- MFC界面库BCGControlBar v25.3新版亮点:支持Visual Studio 2017
- 练习1:百度前端技术学院
- Unity 场景分页插件 World Streamer 支持无限大地图的解决方案(一)
- 微信小程序-弹出自定义对话框
- Fence Repair
- File类
- UVA
- Tomcat 字符编码问题
- python中的全局变量与局部变量
- 产品怎样做好后台管理系统
- Android面试攻略
- DRUID配置多数据源项目
- input上传图片+预览图片