uva10003 - Cutting Sticks(简单动规)

/*
 * Author:  Bingo
 * Created Time:  2015/2/13 18:33:03
 * File Name: uva10003.cpp
 */
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <time.h>
using namespace std;
const int maxint = -1u>>;
int l,n;
int a[],d[];
int f[][];
int main()
{
    while (cin>>l&&l){
        cin>>n;
        d[]=;
        for (int i=;i<=n;i++) {
            cin>>d[i];
        }
        d[n+]=l;
        n=n+;
        memset(f,,sizeof(f));
        int len;
        for (int i=;i<n-;i++)
            f[i][i+]=d[i+]-d[i];
        for (len=;len<n;len++)
            for (int i=;i<n-len;i++){
                int &t=f[i][i+len];
                t=;
                for (int k=i+;k<i+len;k++) {
                    t=min(t,f[i][k]+f[k][i+len]+d[i+len]-d[i]);
                    //printf("%d %d %d\n",d[i],d[i+len],t);
                }
            }
        cout<<"The minimum cutting is "<<f[][n-]-l<<"."<<endl;
    }

    return ;
}

acm我要坚持下去，再苦也要坚持下去