题意:
给一根长为L的木棒,现在要对它在n个点上切割,每次切割的代价就是当前这个点所在的木棒的长度。
现在选定切割点的顺序,使切割的总代价最小。
解析:
初始化,所有段为inf.
当切割的两段是相邻的两段,为边界点,此时dp[i][j] = 0.
状态转移方程:
dp[ i ] [ j ] = min(dp[ i ] [ j ], dp[ i ][ k ] + dp[ k ][ j ] + pos[ j ] - pos[ i ])
对于第i个点和第j个点间的子结构,选择最优的切割点k,形成当前的最优子结构。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long
using namespace std;
const int maxn = 50 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);
int dp[maxn][maxn];
int pos[maxn];
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
int L;
while (scanf("%d", &L) && L)
{
int n;
scanf("%d", &n);
memset(dp, inf, sizeof(dp));
for (int i = 1; i <= n; i++)
{
scanf("%d", &pos[i]);
}
pos[0] = 0;
pos[n + 1] = L;
for (int j = 0; j <= n + 1; j++)
{
for (int i = j; 0 <= i; i--)
{
if (i == j - 1)
{
dp[i][j] = 0;
}
else
{
for (int k = i + 1; k < j; k++)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + pos[j] - pos[i]);
}
}
}
}
printf("The minimum cutting is %d.\n", dp[0][n + 1]);
}
return 0;
}