poj 3253 Fence Repair(优先队列+贪心)
来源:互联网 发布:网络风险有哪些 编辑:程序博客网 时间:2024/05/20 20:01
题目链接:http://poj.org/problem?id=3253点击打开链接
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).
可以逆向思维 从每个小板拼成大板 这样子就是贪心每次找最小的两个
#include <stdio.h>#include <queue>#include <vector>using namespace std;int main(){ long long int n=0; long long int ans=0; scanf("%lld",&n); priority_queue<long long int ,vector<long long int >,greater<long long int > > q; for(int i=0;i<n;i++) { long long int nn; scanf("%lld",&nn); q.push(nn); } while(q.size()>=2) { long long int mid1; long long int mid2; mid1=q.top(); q.pop(); mid2=q.top(); q.pop(); ans+=mid1+mid2; mid1+=mid2; q.push(mid1); } //ans+=q.top(); printf("%lld",ans);}
- 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(贪心+优先队列)
- 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(优先队列)
- jdbc测试mysql数据库sql预解析(绑定变量)
- poj 1562 DFS(深度遍历)
- php分页
- #8 通过Actions触发变化
- Jquery的ajax默认的ContentType和数据格式
- poj 3253 Fence Repair(优先队列+贪心)
- csu1329 一个盒子
- C++中的引用
- jdbc测试mysql数据库sql预解析(绑定变量)
- 常用linux命令(20个)
- React && Redux 学习笔记(一)
- Android Input Method Sample Code Analysis
- 由Sophix引发的安卓热更新底层原理探索
- 内容解析者获取手机通讯录信息