#include <bits/stdc++.h> using namespace std; int N,L,cut[12000],dp[1200][1200]; int main(){ cin>>L; while (L!=0) { cin>>N; for (int i=1; i<=N; ++i) cin>>cut[i]; cut[0]=0; cut[N+1]=L; memset(dp,127/2,sizeof(dp)); for (int i=0; i<=N; ++i) dp[i][i+1]=0; for (int i=2; i<=N+1; ++i) //枚举跨度 for (int s=0; s+i<=N+1; ++s) //枚举起始点 for (int k=s+1; k<s+i; ++k) //k分成两部分 dp[s][s+i]=min(dp[s][s+i],dp[s][k]+dp[k][s+i]+cut[s+i]-cut[s]); cout<<"The minimum cutting is "<<dp[0][N+1]<< "."<<endl; cin>>L; } return 0; }