UVa 10003 - Cutting Sticks 区间dp
来源:互联网 发布:手机淘宝卖家实名认证 编辑:程序博客网 时间:2024/05/16 10:05
Cutting Sticks
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.
---------------------------------------
区间dp的经典题目?。。。。。
f[i][j]表示切割区间i-j的最小费用。
枚举k,f[i][j]=min(f[i][k]+f[k][j]+a[j]-a[i]);(i<k<j);
从今天开始练短码
---------------------------------------
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int OO=1e9;int f[111][111];int a[111];int n;int l;int dfs(int l,int r){ int ret=OO; if (f[l][r]!=-1) return f[l][r]; if (l==r) return f[l][r]=0; if (l+1==r) return f[l][r]=0; for (int k=l+1;k<=r-1;k++) ret=min( ret, dfs(l,k)+dfs(k,r)+a[r]-a[l] ); return f[l][r]=ret;}int main(){ while (~scanf("%d",&l)) { if (l==0) break; memset(a,0,sizeof(a)); memset(f,-1,sizeof(f)); scanf("%d",&n); for (int i=1;i<=n;i++) scanf("%d",&a[i]); a[0]=0; a[n+1]=l; int ans=dfs(0,n+1); printf("The minimum cutting is %d.\n",ans); } return 0;}
- UVa 10003 - Cutting Sticks 区间dp
- uva 10003 Cutting Sticks (区间dp)
- uva 10003 - Cutting Sticks(区间DP)
- uva 10003 Cutting Sticks(区间DP)
- UVA 10003 Cutting Sticks(区间dp)
- UVA 10003 - Cutting Sticks(区间DP)
- UVA 10003 Cutting Sticks 区间DP
- UVa 10003 Cutting Sticks (区间dp)
- uva 10003 Cutting Sticks 【区间dp】
- UVA - 10003 Cutting Sticks 区间DP
- Uva 10003-Cutting Sticks(区间DP)
- UVA 10003 - Cutting Sticks (区间DP)
- UVA - 10003 - Cutting Sticks (区间DP)
- uva 10003 Cutting Sticks 简单区间dp
- UVA 10003 Cutting Sticks 区间DP
- UVA 10003 Cutting Sticks(区间DP)
- UVA 10003 Cutting Sticks(区间dp)
- UVA 10003 Cutting Sticks 区间dp
- Android获取图片资源之——拍照后在程序中显示照片
- 动态链表
- Eddy's picture+生成树+prime算法
- Java中Date类和Calender类的比较_IT168文库
- 【Linux学习笔记】栈与函数调用惯例—下篇
- UVa 10003 - Cutting Sticks 区间dp
- Servlet调用过程和生命周期
- C语言位运算详解
- android开发:按钮事件
- SimpleDateFormat使用详解
- Web缓存系列之webapp缓存思路
- android自带的xml解析类分析
- 以字符串为例比较指针与数组的特性
- struts2输入验证总结