Cutting Sticks
来源:互联网 发布:windows 保存窗口大小 编辑:程序博客网 时间:2024/05/17 22:04
UVA 10003
问题描述
You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work requires that they only make one cut at a time.
It is easy to notice that different selections in the order of cutting can led to different prices. For example, consider a stick of length 10 meters that has to be cut at 2, 4 and 7 meters from one end. There are several choices. One can be cutting first at 2, then at 4, then at 7. This leads to a price of 10 + 8 + 6 = 24 because the first stick was of 10 meters, the resulting of 8 and the last one of 6. Another choice could be cutting at 4, then at 2, then at 7. This would lead to a price of 10 + 4 + 6 = 20, which is a better price.
Your boss trusts your computer abilities to find out the minimum cost for cutting a given stick.
Input
The input will consist of several input cases. The first line of each test case will contain a positive number l that represents the length of the stick to be cut. You can assume l < 1000. The next line will contain the number n (n < 50) of cuts to be made.The next line consists of n positive numbers ci ( 0 < ci < l) representing the places where the cuts have to be done, given in strictly increasing order.
An input case with l = 0 will represent the end of the input.
Output
You have to print the cost of the optimal solution of the cutting problem, that is the minimum cost of cutting the given stick. Format the output as shown below.Sample Input
100325 50 751044 5 7 80
Sample Output
The minimum cutting is 200.The minimum cutting is 22.
//此题利用一个滚动数组,每次合并两端长度最小的区间,见下文
#include<iostream>#include<fstream>#include<cmath>#include<cstdlib>using namespace std;ifstream fin("C:\\data23.in");int l,n;int minimum;int c[50];void DP(){int min,pos;while(n>0){ min=32767; for(int i=1;i<=n;++i) { int partlength=c[i+1]-c[i-1]; if(partlength<min) { min=partlength; pos=i;} } for(int j=pos;j<=n;++j) c[j]=c[j+1]; minimum+=min;--n; }}void Init(){while(fin>>l&&l!=0){minimum=0;memset(c,0,sizeof(c));fin>>n;for(int i=1;i<=n;++i)fin>>c[i];c[n+1]=l;DP();cout<<"The minimum cutting is "<<minimum<<"."<<endl;}}int main(){Init();system("pause");return 0;}
- Cutting Sticks
- UVa 10003 Cutting Sticks
- UVA 10003 - Cutting Sticks
- UVa 10003 - Cutting Sticks
- uva 10003 Cutting Sticks
- UVa 10003.Cutting Sticks
- uva:10003 - Cutting Sticks
- UVa 10003 Cutting Sticks
- UVa 10003 Cutting Sticks
- UVa 10003 - Cutting Sticks
- UVA 10003 Cutting Sticks
- UVaOJ 10003 Cutting Sticks
- Uva - 10003 - Cutting Sticks
- UVa 10003 - Cutting Sticks
- UVa 10003 - Cutting Sticks
- 10003 - Cutting Sticks
- UVA 10003 Cutting Sticks
- UVa10003 - Cutting Sticks
- android存取数据方式:文件、SharedPreferences
- Servlet(四)Servlet映射URL
- 【英语学习】十一月份
- VMware Workstation 10.0.4多国语言(含简体中文)+激活方法
- 编写i2c驱动-基于Linux3.10
- Cutting Sticks
- PDFBox解析PDF文档信息(属性、内容、图片)
- 使用命名管道与 MetaTrader 5 进行无 DLL 通信
- 项目引导页动画的总结
- 导入excel数据到sql server 2008
- MetaTrader的拓展应用,创建自己的DLL程序
- microsoft help viewer 收藏夹功能
- GDI基础知识
- 欧几里得算法 --- 辗转相除法求最大公约数