Cutting Sticks+uva+区间dp
来源:互联网 发布:4g网络制式 编辑:程序博客网 时间:2024/04/30 09:44
Description
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.
#include <iostream>#include<cstdio>#include<cstring>using namespace std;int cut[55];const int inf=0x3f3f3f3f;long long dp[10003][10003];int l,n;void init(){ cut[0]=0,cut[n+1]=l; for(int i=0;i<=n;i++){ dp[cut[i]][cut[i+1]]=0; }}///不用切割的那段都初始化为0;int main(){ while(~scanf("%d",&l)&&l) { scanf("%d",&n); for(int i=1; i<=n; i++) { scanf("%d",&cut[i]); } init(); for(int i=2;i<=n+1;i++){ for(int j=0;j+i<=n+1;j++){ long long temp=inf; for(int k=1;k<i;k++){///枚举中间切割位置 temp=min(temp, dp[cut[j]][cut[j+k]]+dp[cut[j+k]][cut[j+i]]); } dp[cut[j]][cut[j+i]]=temp+cut[j+i]-cut[j]; } } printf("The minimum cutting is %lld.\n",dp[0][l]); } return 0;}
- Cutting Sticks+uva+区间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)
- Matlab 命令记录
- c语言调用库函数qsort()进行快速排序
- Android 打开软键盘
- oracle_随机抽取N条数据
- Linux平台VPN技术概论
- Cutting Sticks+uva+区间dp
- 使用dump restore方式快速备份恢复FreeBSD系统
- directshow 视频显示,USB接口按钮触发事件捕获
- 慎用读写锁
- Images can't contain alpha channels or transparencies.
- JSON 之FastJson解析
- tomcat热部署(二)
- 微博CacheService架构浅析
- 【Unity Shaders】使用Unity Render Textures实现画面特效——画面特效中的类似Photoshop的基本混合模式