10003 - Cutting Sticks
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=944
You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work requires that they only make one cut at a time.
It is easy to notice that different selections in the order of cutting can led to different prices. For example, consider a stick of length 10 meters that has to be cut at 2, 4 and 7 meters from one end. There are several choices. One can be cutting first at 2, then at 4, then at 7. This leads to a price of 10 + 8 + 6 = 24 because the first stick was of 10 meters, the resulting of 8 and the last one of 6. Another choice could be cutting at 4, then at 2, then at 7. This would lead to a price of 10 + 4 + 6 = 20, which is a better price.
Your boss trusts your computer abilities to find out the minimum cost for cutting a given stick.
Input
The input will consist of several input cases. The first line of each test case will contain a positive number l that represents the length of the stick to be cut. You can assume l < 1000. The next line will contain the number n (n < 50) of cuts to be made.
The next line consists of n positive numbers ci ( 0 < ci < l) representing the places where the cuts have to be done, given in strictly increasing order.
An input case with l = 0 will represent the end of the input.
Output
You have to print the cost of the optimal solution of the cutting problem, that is the minimum cost of cutting the given stick. Format the output as shown below.
Sample Input
100 3 25 50 75 10 4 4 5 7 8 0
Sample Output
The minimum cutting is 200. The minimum cutting is 22.
根据“charges money according to the length of the stick being cut”，
我们有：dp[i][j] = min{dp[i][k] + dp[k][j]} + c[j] - c[i]
这里c[i]和c[j]为木棍的起点和终点。
完整代码：
/*0.089s*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
int c[60], dp[60][60];
int main(void)
{
int len, n;
while (scanf("%d", &len), len)
{
scanf("%d", &n);
c[0] = 0, c[n + 1] = len;
for (int i = 1; i <= n; ++i)
scanf("%d", &c[i]);
memset(dp, 0, sizeof(dp));
for (int p = 2; p <= n + 1; ++p) ///从2段的木棍开始合并
for (int i = 0; i <= n + 1 - p; ++i)///i为起点,j为终点
{
int j = i + p, Min = INF;
for (int k = i + 1; k < j; ++k)
Min = min(Min, dp[i][k] + dp[k][j]);
//if(Min!=INF)
dp[i][j] = Min + c[j] - c[i];
}
printf("The minimum cutting is %d.\n", dp[0][n + 1]);
}
return 0;
}
查看本栏目更多精彩内容：http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/
以上是小编为您精心准备的的内容，在的博客、问答、公众号、人物、课程等栏目也有的相关内容，欢迎继续使用右上角搜索按钮进行搜索length
， to
， minimum
， of
， The
， cut
STICKS
uva 10003、sticks、sticks and stones、count the sticks、pick up sticks，以便于您获取更多的相关知识。