poj3253 Fence Repair
来源:互联网 发布:如何建立网络 编辑:程序博客网 时间:2024/06/06 02:45
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.
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).
ac代码:
using namespacestd;
struct cmp1{ booloperator ()(longlong &a,long long &b){
return a>b;
}
};
int main(){
long long n,m;
while(cin>>n)
{
priority_queue<long long,vector<longlong>,cmp1> que;
for(int i=1;i<=n;i++)
{
scanf("%lld",&m);
que.push(m);
}
long long re=0;
while(!que.empty())
{
long long sum=0;
sum+=que.top();
que.pop();
if(!que.empty())
{
sum+=que.top();
que.pop();
if(!que.empty())
que.push(sum);
}
re+=sum;
}
cout<<re<<endl;
}
return 0;
}
- POJ3253 Fence Repair
- poj3253 Fence Repair( 贪心 )
- poj3253 Fence Repair
- poj3253 Fence Repair
- poj3253 Fence Repair---赫夫曼树
- poj3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253--Fence Repair
- POJ3253 Fence Repair(贪心)
- POJ3253 Fence Repair
- poj3253 Fence Repair
- Poj3253—Fence Repair
- POJ3253-Fence Repair
- POJ3253-Fence Repair
- [POJ3253]-Fence Repair
- POJ3253-Fence Repair
- POJ3253 Fence Repair
- 对封装的新了解
- JSP在页面加载时调用servlet的方法
- C# 播放音频文件
- hibernate 一对多表配置及操作
- 数组去重的方法总结
- poj3253 Fence Repair
- [IOS] 图片显示 imageNamed, initWithContentsOfFile 的区别
- (新人)关于自己对java的继承、封装、抽象类和接口的理解
- github上删除自己的repository
- 如何让热点图支持大数据
- 为CentOS添加新网卡配置
- Java项目经验——程序员成长的钥匙
- C++ 补充
- 刷清橙OJ--A1026.字符统计