UVa:10003 Cutting Sticks
来源:互联网 发布:试君眼力知多少 编辑:程序博客网 时间:2024/06/01 10:19
区间DP,1Y。
跟矩阵最优链乘相似。
状态转移方程是dp[i][j]=p[j]-p[i]+min{dp[i][k]+dp[k][j]}(i<k<j)
三重循环,分别枚举长度起点切点。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){ int L,N; while(scanf("%d",&L)&&L) { scanf("%d",&N); int dp[55][55]={0},p[54]={0}; for(int i=1; i<=N; ++i) scanf("%d",&p[i]); p[0]=0; p[N+1]=L; N++; for(int l=1; l<=N; ++l) for(int i=0; i+l<=N; ++i) { int j=i+l; int mn=0; for(int k=i+1; k<j; ++k) if(k==i+1||(dp[i][k]+dp[k][j])<mn) { mn=dp[i][k]+dp[k][j]; dp[i][j]=p[j]-p[i]+mn; } } printf("The minimum cutting is %d.\n",dp[0][N]); } return 0;}
- 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
- 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
- CSDN我来了
- boost库在工作(39)网络UDP异步服务端之九
- DAY 21 list
- Android界面规范
- 一个用于Objective-C静态检查的工具-occheck
- UVa:10003 Cutting Sticks
- DAY 22 List
- Android打包
- Day 23 list
- Day 24 list
- Day 25
- Day 26 list
- Android的解析二维码图片实例
- Day 27 list