uva10003 - Cutting Sticks(DP,区间)

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int mm=55;
const int oo=1e9;
int f[mm];
int dp[mm][mm];///a到b之间的最优值
int ans;
int DP(int a,int b)
{
if(dp[a][b])return dp[a][b];
if(a==b-1)return 0;///就一段
int _min=oo;
for(int i=a+1;i<b;++i)
{
_min=std::min(_min,DP(a,i)+DP(i,b));
}
dp[a][b]=_min+f[b]-f[a];
return dp[a][b];
}
int main()
{
int len,n;
while(~scanf("%d",&len)&&len)
{ ans=0;scanf("%d",&n);
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;++i)
scanf("%d",&f[i]);
f[0]=0;f[n+1]=len;
printf("The minimum cutting is %d.\n",DP(0,n+1));
}
}