uva 10003 Cutting Sticks(区间DP)
来源:互联网 发布:房地产文案 知乎 编辑:程序博客网 时间:2024/05/29 05:56
题意:给出一个长l的木棍, 再给出n个要求切割的点,每次切割的代价是当前木棍的长度, 现在要求输出最小代价。
/*给定一段len长的木棍,有n个切割点,每个切割点切掉的花费是当前切割点所在木棍的长度,求最少的花费。*/#include<stdio.h>#include<string.h>#include<iostream>#include<string>#include<map>#include<queue>#include<algorithm>using namespace std;const int inf=1<<29;const int maxm=1e2+10;int c[maxm];int dp[maxm][maxm];int dfs(int a,int b){ if(dp[a][b]) return dp[a][b]; if(a==b-1) return 0; dp[a][b]=inf; for(int i=a+1; i<=b-1; i++) { dp[a][b]=min(dp[a][b],dfs(a,i)+dfs(i,b)); } return dp[a][b]+=(c[b]-c[a]);}int main(){ int len; while(scanf("%d",&len)!=EOF&&len) { memset(dp,0,sizeof(dp)); int n; scanf("%d",&n); for(int i=1; i<=n; i++) { scanf("%d",&c[i]); } // sort(c,c+n+1); c[n+1]=len; int ans=dfs(0,n+1); printf("The minimum cutting is %d.\n",ans); } return 0;}
0 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
- SQL Server 2008导入、导出数据库
- swift 2.2 语法(中)
- 一些想要或读过的书及个人评价
- 控件缩写规范
- Android自定义控件
- uva 10003 Cutting Sticks(区间DP)
- java 空字符串与null区别
- assign和weak的区别
- 华为在线训练之16进制转换10进制
- HDU - 2087 剪花布条(Kmp)
- 配置my.cnf
- fspecial()函数解析
- Java分页
- 思维导图教你看懂----------Java IO流