SDAU 1008

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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .

 

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 2n 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

题目大意：

有一些木棒等待加工，给出木棒的长度和质量，如果下一个木棒的长度和质量   >=   上一个，那么机器就不需要准备时间，不然的话，如要 1 min ，求加工这些木棒最短时间。

思路：

课件上用这个例题，和那个活动安排一个类型，按照其中一个量 从小到大排好序后 找。

AC代码

#include
#include

int themax(int n,sta a[])
{
       int b[6000]={0};
       int i,j,k,maxx=0;
       b[0]=1;
       for(i=1;i
       {
               k=0;
               for(j=0;j
        {
            if(a[j].wig>a[i].wig&&(k
        }
        b[i]=k+1;
    }
    for(i=0;i
    {
        if(b[i]>maxx) maxx=b[i];
    }
    return maxx;
}
int main()
{
    //freopen("r.txt", "r", stdin);
    int N,i,n;
    sta test[6000];
    cin>>N;
    while(N--)
    {
        cin>>n;
        for(i=0;i
        {
            cin>>test[i].leng;
            cin>>test[i].wig;
        }
        sort(test,test+n,cmp);
        cout<<themax(n,test)<<endl;
    }
}