UVA-10003 切木棍，区间dp

dp[i][j]表示对 区间为（i，j）的棍子 的处理，注意对两端的处理

#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
#define DEBUG
const int maxn=1000+5,maxv=26,INF=0x3f3f3f3f;
int L,n,a[maxn],dp[maxn][maxn];
int main(){
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    while(scanf("%d",&L)!=EOF&&L!=0){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        a[0]=0;a[n+1]=L;
        memset(dp,0x3f,sizeof(dp));
        for(int p=0;p<=n+1;p++){
            for(int i=0;i+p<=n+1;i++){
                int j=i+p;
                if(p<=1){dp[i][j]=0;continue;}
                for(int k=i;k<=i+p;k++){
                    dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+a[j]-a[i]);
                }
            }
        }
        printf("The minimum cutting is %d.\n",dp[0][n+1]);
    }
#ifdef DEBUG
    fclose(stdin);
    fclose(stdout);
#endif
    return 0;
}