UVa10003

#include<stdio.h>
#include<string.h>
int main()
{
    int m[100][100],l,n,a[100],c[100],i,j,r,sum;
    while(scanf("%d",&l)!=EOF&&l)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
        scanf("%d",&c[i]);
        c[n]=l;a[0]=c[0];
        for(i=1;i<=n;i++)
        a[i]=c[i]-c[i-1];
        memset(m,0,sizeof(m));
        for(r=1;r<=n;r++)
        for(i=0;i<n;i++)
        {
            j=i+r;sum=0;
            for(int k=i;k<=j;k++)
            sum+=a[k];
            m[i][j]=m[i][i]+m[i+1][j]+sum;
            for(int k = i+1;k<j;k++)
            {
                int temp=m[i][k]+m[k+1][j]+sum;
                if(temp<m[i][j])
                {
                    m[i][j]=temp;
                }
            }
        }
        printf("The minimum cutting is %d.\n",m[0][n]);
    }
    return 0;
}