uva 10003 - Cutting Sticks

/*************************************************************************
> File Name: 10003.cpp
> Author: bxf
> Mail: bbb546754186@vip.qq.com
> Created Time: 2014年08月07日 星期四 19时50分57秒
************************************************************************/

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <set>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0xfffffff
#define maxn 1000 + 10
#define ll long long

using namespace std;
int s[60];
int dp[maxn][maxn];
int n;
int DP(int x, int y)
{
int &ans = dp[x][y];
if(ans != -1) return ans;
if(y-x <= 1)
return ans = 0;
ans = INF;
for(int i = x+1; i < y; ++i)
{
ans = min(ans, DP(x, i)+DP(i, y)+s[y]-s[x]);
}
return ans;
}
int main()
{
int length;
while(scanf("%d", &length) != EOF)
{
if(!length) break;
scanf("%d", &n);
s[0] = 0; s[n+1] = length;
for(int i = 1; i <= n; ++i)
scanf("%d", &s[i]);
memset(dp, -1, sizeof(dp));
printf("The minimum cutting is %d.\n", DP(0, n+1));
}
return 0;
}