POJ 3253 Fence Repair (Huffman tree)
来源:互联网 发布:node.js工资待遇 编辑:程序博客网 时间:2024/05/29 16:52
http://poj.org/problem?id=3253
用优先权队列来处理
要将iostream头文件加进去!
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤N ≤ 20,000) planks of wood, each having some integer lengthLi (1 ≤Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN planks (i.e., whose length is the sum of the lengthsLi). 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 theN-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 theN 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).
#include <cstdio>#include <iostream>#include <queue>#include <vector>using namespace std;struct cmp{bool operator() (const int &a,const int &b){return a>b;}};int main(){priority_queue <int,vector<int>,cmp> q;int n;int d;scanf("%d",&n);while (!q.empty()){q.pop();}for (int i=0;i<n;i++){scanf("%d",&d);q.push(d);}int tmp;int a,b;long long ans=0;while (q.size() != 1){a=q.top();q.pop();b=q.top();q.pop();ans+=a+b;q.push(a+b);}printf("%lld\n",ans);}
- POJ 3253 Fence Repair(构造Huffman Tree)
- POJ 3253 Fence Repair (Huffman tree)
- POJ 3253 Fence Repair Huffman
- POJ 3253 fence repair 贪心法 huffman
- POJ 3253 - Fence Repair(贪心+Huffman)
- poj 3253 Fence Repair 【huffman树 贪心】
- POJ 3253 Fence Repair(贪心, Huffman编码)
- POJ 3253 Fence Repair (哈夫曼树)Haffman-tree
- poj 3253 Fence Repair(Huffman问题,优先队列priority_queue)
- POJ 3253 Fence Repair (贪心 + Huffman树)
- POJ 3253 Fence Repair(huffman树的应用)
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- 面试中的概率问题 - 数学期望(2) - 武器升级需要的宝石数
- Android 使用AudioRecord录音相关和音频文件的封装
- 设计模式六大原则
- 有些话,那么悲伤,那么简短_伤感唯美日志
- Windows Vista Smart Card Infrastructure
- POJ 3253 Fence Repair (Huffman tree)
- 图文介绍openLDAP在windows上的安装配置
- 理解ios开发中的输出口(Outlet)和操作(action)
- Aqua跨库数据导入
- 语音编解码的一些概念
- C#版 判断字符编码
- FFMpeg框架代码阅读
- 让Javadoc支持 utf-8
- 毛毛最新推荐伤感日志:我是一个任性的孩子