poj-3253-Fence Repair
来源:互联网 发布:产业链分析理论 知乎 编辑:程序博客网 时间:2024/05/01 03:07
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 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 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).
给你一个数n,然后输入n个数每一个代表最后的一个长度,他要求的是他的花费(疲劳也可以吧),hInt里很清楚,一个长为21的棍子,劈开就花费21。这道题求最小花费。其实也可算是贪心吧,但是我是用优先队列写的,把最小的两个拿出来,加在一起得出花费,这样的花费必然是最小的
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<queue>using namespace std;typedef long long ll;int n,a[20005];int solve(){ ll ans=0; priority_queue<int, vector<int>, greater<int> >que; for(int i=0;i<n;i++) { que.push(a[i]); } while(que.size()>1) { int l1,l2; l1=que.top(); que.pop(); l2=que.top(); que.pop(); ans+=l1+l2; que.push(l1+l2); } printf("%lld",ans);}int main(){ while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%d",&a[i]); solve(); } 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 3253Fence 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
- 基于OpenCV的文件夹遍历
- C++实验2-标准体重
- qt中文乱码
- 深入理解Objective-C的Runtime机制
- 【追求进步】反转链表
- poj-3253-Fence Repair
- 【机房个人重构】组合查询--模板方法
- Mongo 增加用户名密码
- android 超大字体解决办法
- c++实验2--计算标准体重
- WIFI状态监听
- Android logo图标大小
- 周鸿祎:很多程序员聪明,但我一看就知道他不会成功
- 从技术细节看美团架构