POJ3253-- Fence Repair【优先队列】
来源:互联网 发布:淘宝即将上架抢购攻略 编辑:程序博客网 时间:2024/06/07 16:44
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
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Sample Input
3858
Sample Output
34
Hint
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).
题意:
要把一个木板钜成几块给定长度的小木板,每次锯都要收取一定费用,这个费用就是当前锯的这个木版的长度
给定各个要求的小木板的长度,及小木板的个数n,求最小费用
哈夫曼思想+优先队列的应用
优先队列的介绍:http://blog.csdn.net/baochunzhi/article/details/7664422
#include <iostream>#include <algorithm>#include <queue>using namespace std;struct node{ int x,y; friend bool operator < (node a,node b){ return a.x>b.x; }};int main (){ int t; while(cin>>t){ node m; __int64 sum=0;// priority_queue<node>q; while(t--){ cin>>m.x; q.push(m); } if(q.size()==1){ m=q.top(); sum+=m.x; // q.pop(); } while(q.size()>1){ node n,k; n=q.top(); q.pop(); k=q.top(); q.pop(); m.x=n.x+k.x; sum+=m.x; q.push(m); } cout<<sum<<endl; } return 0;}
- POJ3253-- Fence Repair【优先队列】
- poj3253 Fence Repair【优先队列】
- poj3253 Fence Repair(优先队列)
- POJ3253《Fence Repair》方法:优先队列
- poj3253 Fence Repair【哈夫曼树+优先队列】
- poj3253 Fence Repair (优先队列)
- 【POJ3253】Fence Repair(优先队列+贪心)
- poj3253 Fence Repair 贪心/优先队列
- POJ3253 Fence Repair【哈夫曼树+优先队列】
- POJ3253 Fence Repair (二叉堆 | 优先队列 | huffman树 )
- POJ3253 Fence Repair 贪心+优先队列(堆维护)
- Fence Repair 【优先队列】
- Fence Repair (优先队列)
- poj3253 Fence Repair 优先队列,C++STL中priority_queue的使用
- poj3235 Fence Repair【优先队列】
- Fence Repair (优先队列)
- POJ3253 Fence Repair
- poj3253 Fence Repair( 贪心 )
- Java Web笔记:XML解析的四种方法
- 从一个URL下载原始数据,基于byte字节
- 【spring框架】bean的生命范围(scope)
- 协议与委托
- Android 图片拖动
- POJ3253-- Fence Repair【优先队列】
- 如何把X264输出的INFO信息保存到文件
- 值得关注的十个新开源工具
- VCS(版本控制系统)
- iOS 纯代码适配6、plus
- Libvirt/KVM 中的网络模式
- Java给定一个long值返回格式化日期样式
- 面试常考:int a[5],问a和&a的区别
- 关于消息、接口等内容的一些区别分析