uva10003-切割木棍

#include<stdio.h> 
#include<string.h>
const int maxLen = 55;
const int inf = 1<<31-1;
int cost[maxLen][maxLen];
int num[maxLen];
int n, l;
int getCost(int start, int end)
{
    if(cost[start][end] < inf) return cost[start][end];
    if(start + 1 == end) return 0; 
    for(int k=start+1; k<end; k++) {
        int u;
        u = getCost(start, k) + getCost(k, end) + num[end] - num[start];
        if(u < cost[start][end]) { cost[start][end] = u; }
    }
    return cost[start][end];
}
int main()
{
    while(scanf("%d%d", &l, &n) == 2) {
        for(int i=0; i<maxLen; i++) for(int j=0; j<maxLen; j++) cost[i][j] = inf;
        num[0] = 0; num[n+1] = l;
        for(int i=1; i<=n; i++) scanf("%d", &num[i]);
        printf("The minimum cutting is %d.\n", getCost(0, n+1));
    }
    return 0;
}