acm 1001 木桩放置

1.1001

2.Problem Description
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: 


(a) The setup time for the first wooden stick is 1 minute. 
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup. 


You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).


 


Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, ..., ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces. 
 


Output
The output should contain the minimum setup time in minutes, one per line. 
 


Sample Input
3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1
 


Sample Output
2
1
3

由于机器原因，放置木桩从短到长，从轻到重最节约时间

3.思路

结构体表示木板信息

先按木板长度使用贪心算法，设定好长度排序

使用动态规划的方法计算重量单调递增子序列个数

将木板长和重量的信息进行匹配输出

4.感想

本题老师在课堂上讲过，在听讲之前编写遇到了一些困难，题目使用了贪心的思想兼具动态规划的内容，调试了几遍后终于通过，总体来说比较顺利

5.

#include<iostream>

#include<vector>

#include<algorithm>

#include<numeric>

#include<map>

using namespacestd;

struct stick

{

    int l;

    int w;

};

int cmp(stick a,stick b)

{

    if (a.l==b.l)     return a.w<b.w;

    else if (a.l<b.l) return true;

    return false;

}

 

int lis(intn,stick s[])

{

    int b[5001]={0};

    int i,j,k,max=0;

    b[0]=1;

    for(i=1;i<n;i++)

    {

        k=0;

        for(j=0;j<i;j++)

         if(s[i].w<s[j].w&&(k<b[j])) k=b[j];

        b[i]=k+1;

    }

    for(i=0;i<n;i++)

      if(b[i]>max) max=b[i];

    return max;

}

int main()

{

    int T,i,n;

    stick s[5001];

    cin>>T;

    while(T--)

    {

        cin>>n;

        for(i=0;i<n;i++)

        {

            cin>>s[i].l>>s[i].w;

        }

        sort(s,s+n,cmp);

        cout<<lis(n,s)<<endl;

    }

    return 0;

}