UVA 10003 Cutting Sticks 区间DP

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>

using namespace std;
const int INF = 0x3fffffff;
int dp[100][100]; // d(i, j)在 [i , j] 区间切割的最优费用
int n;
int a[100];

int main() {
    int l;
    while( ~scanf( "%d", &l ) && l ) {
        scanf( "%d", &n );
        a[0] = 0;
        a[n+1] = l;
        for( int i = 1; i <= n; i++ ) {
            scanf( "%d", &a[i] );
        }
        for( int i = 0; i <= n+1; i++ ) {
            for( int j = 0; j <= n+1; j++ ) {
                dp[i][j] = INF;
            }
        }
        for( int i = 0; i <= n; i++ ) {
            dp[i][i+1] = 0;
        }
        for( int d = 2; d <= n+1; d++ ) {
            for( int s = 0; s <= n+1; s++ ) {
                for( int k = s+1; k < s+d; k++ ) {
                    dp[s][s+d] = min( dp[s][s+d], dp[s][k] + dp[k][s+d] + a[s+d] - a[s] );
                }
            }
        }
//        for( int i = 0; i <= n+1; i++ ) {
//            for( int j = 0; j <= n+1; j++ ) {
//                cout << dp[i][j] << " ";
//            }
//            cout << endl;
//        }
        printf( "The minimum cutting is %d.\n", dp[0][n+1] );
    }
    return 0;
}