POJ
来源:互联网 发布:在淘宝网上卖东西 编辑:程序博客网 时间:2024/06/08 15:46
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 <iostream>#include <cstdio>#include <queue>using namespace std;int main(){int n;while(scanf("%d",&n)!=EOF){if(n==1){int t;scanf("%d",&t);printf("%d\n",t);continue;}priority_queue<int,vector<int>,greater<int> >q;int i;long long sum=0;for(i=0;i<n;i++){int t;scanf("%d",&t);q.push(t);}while(q.size()!=1){int a,b;a=q.top();q.pop();b=q.top();q.pop();q.push(a+b);sum+=a+b;}printf("%lld\n",sum);}return 0;}
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- java代码块的划分及作用
- Java生成和操作Excel文件
- Elasticsearch 429,logstash没有更新kafka队列状态的问题
- 基于html5 websocket API简单实现断点上传文件
- C++ error LNK1169:找到一个或多个多重定义的符号 解决
- POJ
- webSocket 消息推送
- 归并排序--Python
- VS2010护眼色
- eclispe 快捷键收集
- iOS代码加密的几种方式
- 网格走法数目
- lucene索引数据库查询
- QQ红点消除功能——自定义RedPointLayout