POJ 3253 Fence Repair(经典贪心问题)
来源:互联网 发布:时间轴页面源码 编辑:程序博客网 时间:2024/05/16 14:32
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>using namespace std;#define MAX_N 20000typedef long long ll;int N,L[MAX_N+1];void solve(){ll ans=0;//直到木板为1为止while(N>1){//求出最短的板mil1和次短的板mil2int mil1=0,mil2=1;if(L[mil1]>L[mil2])swap(mil1,mil2);for(int i=2;i<N;i++){if(L[i]<L[mil1]){mil2=mil1;mil1=i;}else if(L[i]<L[mil2])mil2=i;}//拼合两块板int t=L[mil1]+L[mil2];ans+=t;if(mil1==N-1)swap(mil1,mil2);L[mil1]=t;L[mil2]=L[N-1];N--;}cout<<ans<<endl;}int main(){cin>>N;for(int i=0;i<N;i++)cin>>L[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 Fence Repair 贪心
- POJ 3253 Fence Repair (贪心&优先队列)
- POJ 3253 - Fence Repair(贪心)
- POJ 3253 Fence Repair(贪心,优先队列)
- POJ 3253 fence repair 贪心法 huffman
- POJ 3253 Fence Repair(贪心+优先队列)
- POJ 3253 Fence Repair 贪心+优先队列
- POJ 3253-Fence Repair(贪心)
- POJ 3253 - Fence Repair(贪心+Huffman)
- poj 3253 Fence Repair 【huffman树 贪心】
- POJ 3253 Fence Repair(贪心, Huffman编码)
- CentOs 6.3_64静默安装oracle11g_r2
- 多进程间通信之信号中断处理
- Android编译后的目录结构
- 二叉树中两个节点的最近公共父节点
- 字符串匹配——Brute-Force 简单匹配算法
- POJ 3253 Fence Repair(经典贪心问题)
- LeetCode—二叉树遍历的情况
- c#接口
- 变换管线
- Java中的选择结构
- Android Activity 常用功能设置(全屏、横竖屏等)
- Miller__Rabin素数测试
- Qt中 QString 和int, char等的“相互”转换
- (转)关于推荐系统中的特征工程