UVA10003 Cutting Sticks

https://odzkskevi.qnssl.com/e17d84412b7ea3a42b6503109d6dfbc1?v=1508053531

【题解】

裸区间dp，注意一堆细节

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
inline void swap(int &a, int &b)
{
    int tmp = a;a = b;b = tmp;
}
inline void read(int &x)
{
    x = 0;char ch = getchar(), c = ch;
    while(ch < '0' || ch > '9')c = ch, ch = getchar();
    while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
    if(c == '-')x = -x;
}

const int INF = 0x3f3f3f3f;
const int MAXN = 50 + 10;

int dp[MAXN][MAXN], po[MAXN], n, L;

int main()
{
    while(scanf("%d", &L) != EOF && L)
    {
        read(n);
        for(register int i = 1;i <= n;++ i)
            read(po[i]);
        std::sort(po + 1, po + 1 + n);
        for(register int i = 0;i <= n + 1;++ i) 
            dp[i][i] = 0, dp[i][i + 1] = 0;
        po[n + 1] = L;
        for(register int k = 3;k <= n + 2;++ k)
        {
            for(register int i = 0;i <= n + 1;++ i)
            {
                int j = i + k - 1;
                dp[i][j] = INF;
                if(j > n + 1)continue;
                for(register int m = i + 1;m < j;++ m)
                    dp[i][j] = min(dp[i][j], dp[i][m] + dp[m][j] + po[j] - po[i]);
            }
        }
        printf("The minimum cutting is %d.
", dp[0][n + 1]);
    }
    return 0;
}