POJ 3253 Fence Repair(哈夫曼树+优先队列)
来源:互联网 发布:网络之纵横天下同人 编辑:程序博客网 时间:2024/06/11 06:11
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 Nplanks. 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).
题解:
哈夫曼树水题,用一个优先队列每次取两个最小的,合成一个放入队列中,知道队列长度为1为止
代码:
#include<algorithm>#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>using namespace std;#define lson k*2#define rson k*2+1#define M (t[k].l+t[k].r)/2#define INF 1008611111#define ll long long#define eps 1e-15priority_queue<ll,vector<ll>,greater<ll> >q;int main(){ ll n,x,y,i; long long sum; while(~scanf("%d",&n)) { sum=0; while(!q.empty()) q.pop(); for(i=0;i<n;i++) { scanf("%lld",&x); q.push(x); } while(q.size()>1) { x=q.top(); q.pop(); y=q.top(); q.pop(); x+=y; sum+=x; q.push(x); } printf("%lld\n",sum); } return 0;}
- 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(优先队列)
- POJ:3253 Fence Repair(优先队列)
- Fence Repair(优先队列) POJ 3253
- 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 优先队列维护
- POJ 3253 优先队列 Fence Repair
- POJ 3253 Fence Repair (贪心&优先队列)
- icswb2
- Palindromic Numbers LightOJ
- Lasso回归的坐标下降法推导
- HDMI之TMDS通道
- Linux 之vi应用
- POJ 3253 Fence Repair(哈夫曼树+优先队列)
- ZOJ 1610 Count the Colors (线段树)
- Makefile遍历所有头文件以及源文件
- POJ1017 Packets (贪心)
- POJ
- 单点登录详解(二)--CAS实现单点登录
- ajax请求错误返回status 0和错误error的问题
- tarjan 算法求强连通分量
- HDU 6136 Death Podracing 优先队列 + 循环链表(模拟)