poj 3253 Fence Repair 优先队列
2015-07-10 00:24
519 查看
Fence Repair
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
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
Sample Output
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
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).
Source
USACO 2006 November Gold
有一块长木板,要经过n-1次切割将其切成n块FJ想要的木板,对于每块木板,没切割一次,将会消耗和这条木板长度值相等的金钱,问最少需要多少钱,可将木板切成自己想要的n块
优先队列
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 30810 | Accepted: 9949 |
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
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
3 8 5 8
Sample Output
34
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
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).
Source
USACO 2006 November Gold
有一块长木板,要经过n-1次切割将其切成n块FJ想要的木板,对于每块木板,没切割一次,将会消耗和这条木板长度值相等的金钱,问最少需要多少钱,可将木板切成自己想要的n块
优先队列
#include <iostream> #include <stdio.h> #include <algorithm> #include <string.h> #include <stdlib.h> #include <math.h> #include <vector> #include <queue> #include <stack> #include <map> #include <set> using namespace std; class cmp { public: bool operator()(const __int64 a,const __int64 b)const { return a>b; } }; int main() { int n; while(cin>>n) { priority_queue<long long ,vector<long long>,cmp> q; for(int i=1;i<=n;i++) { long long t; cin>>t; q.push(t); } long long sum=0; while(q.size()>1) { long long a=q.top(); q.pop(); long long b=q.top(); q.pop(); q.push(a+b); sum+=a+b; } cout<<sum<<endl; while(!q.empty()) { q.pop(); } } return 0; }
相关文章推荐
- 当新手使用JS库遇到问题怎么办
- JS-json-1
- fedora 提供的安装包
- javaScript中数组的方法演示
- 5 Reasons to Use Protocol Buffers Instead of JSON For Your Next Service
- jquery常见知识点 总结
- JavaScript声明变量名的语法规则
- 简述Jquery与DOM对象
- jQuery原生的动画效果
- javascript实现的简单的表单验证
- javascript实现确定和取消提示框效果
- javascript检查浏览器是否已经启用XX功能
- javascript实现判断鼠标的状态
- 再谈JavaScript线程
- javascript实现rgb颜色转换成16进制格式
- JavaScript实现打字效果的方法
- JavaScript模板引擎用法实例
- JavaScript实现的类字典插入或更新方法实例
- JavaScript清空数组元素的两种方法简单比较
- javascript实现下班倒计时效果的方法(可桌面通知)