zoukankan      html  css  js  c++  java
  • 【水】uva10003 练手二维DP

    Cutting Sticks 

    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.
    

    Miguel Revilla
    2000-08-21
    program p10003;
    
    Var 
     a:array[0..51] of longint;
     f:array[0..51,0..51] of longint;
     l,n,i,j,k:longint;
    
    Procedure fopen;
      begin
      assign(input,'p10003.in');
      assign(output,'p10003.out');
      reset(input);
      rewrite(output);
    end;
    
    Procedure fclose;
      begin
      close(input);
      close(output);
    end;
    
    Function min(a,b:longint):longint;inline;
      begin
      if a<b then exit(a) else exit(b);
    end;
    
      begin
    
      while true do begin
      readln(l);
      if l=0 then halt;
      readln(n);
      for i:=1 to n do
        read(a[i]);
      a[0]:=0;
      a[n+1]:=l;
      fillchar(f,sizeof(f),$7f);
      for i:=0 to n+1 do
        for j:=i to min(n+1,i+1) do
          f[i,j]:=0;
          
      for j:=2 to n+1 do
        for i:=0 to n+1-j do //f[i,i+j]
          for k:=i to i+j do
            f[i,i+j]:=min(f[i,i+j],f[i,k]+f[k,i+j]+a[i+j]-a[i]);
      writeln('The minimum cutting is ',f[0,n+1],'.'); end;
    
    end.
    
  • 相关阅读:
    CF1080D Olya and magical square
    CF1062D Fun with Integers
    leetcode378 Kth Smallest Element in a Sorted Matrix
    hdoj薛猫猫杯程序设计网络赛1003 球球大作战
    hihocoder1068 RMQ-ST算法
    hihocoder1032 最长回文子串
    hihocoder1394 网络流四·最小路径覆盖
    hihocoder1398 网络流五·最大权闭合子图
    【bzoj4562】HAOI2016食物链
    【bzoj1026】windy数
  • 原文地址:https://www.cnblogs.com/htfy/p/3013082.html
Copyright © 2011-2022 走看看