Fence_Repair
来源:互联网 发布:知乎周刊 mobi下载 编辑:程序博客网 时间:2024/05/16 06:39
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;typedef long long ll;int N;int L[20010];void solve(){ll ans = 0;while(N > 1){int mii1 = 0, mii2 = 1;if(L[mii1] > L[mii2]) swap(mii1, mii2);for(int i = 2; i < N; ++i){if(L[i] < L[mii1]){mii2 = mii1;mii1 = i;}else if(L[i] < L[mii2]){mii2 = i;}}if(mii1 == N - 1) swap(mii1, mii2);int t = L[mii1] + L[mii2];ans += t;L[mii1] = t;L[mii2] = L[N - 1];N--;}cout << ans << endl;}int main(int argc, char const *argv[]){cin >> N;for(int i = 0; i < N; ++i){cin >> L[i];}solve();return 0;}long long
- Fence_Repair
- Codeigniter的一些优秀特性总结
- [leetcode][string] Longest Common Prefix
- CodeIgnite之数据库操作
- C++链表K个节点K个节点的反转((1,2,3,4),如果k是2,反转结果是(2,1,4,3))
- MongoDB学习笔记(索引)
- Fence_Repair
- 类的继承
- 从零开始写类库(2)——对类型的判断
- Android 使用Volley加载网络图片
- Android 图片或者文件上传服务器(Android+Struts2)
- 算法导论中的快速排序详解
- jackson应用
- 欢迎使用CSDN-markdown编辑器
- 浅谈JAVA设计模式之——备忘录模式(Memento)