HDU 1051 Wooden Sticks

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11021    Accepted Submission(s): 4528

链接 1051 HDU

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


  
  

时间过久了就忘了，还是要写一下的；

#include <iostream>
#include <stdlib.h>
using namespace std;
struct wood
{
    int l;
    int w;
} woo[5100];
int cmp(const void *a,const void *b)
{
    wood *p1=(wood *)a,*p2=(wood *)b;
    if(p1->l!=p2->l)
        return p1->l-p2->l;
    return p1->w-p2->w;
}
int find(wood w[],int n)
{
    int i;
    for(i=0; i<n; i++)
    {
        if(w[i].l!=0)
            break;
    }
    return i;
}
int main()
{
    int t,n,i,m,j,k,sum,s,l;
    while(cin>>t)
    {
        while(t--)
        {
            sum=0;
            s=0;
            cin>>n;
            for(i=0; i<n; i++)
                cin>>woo[i].l>>woo[i].w;
            qsort(woo,n,sizeof(woo[0]),cmp);
            m=n;
            while(n>0)
            {
                l=j=find(woo,m);
                k=1;
                for(i=l+1; i<m; i++)
                {
                    if((woo[j].w<=woo[i].w)&&(woo[i].l!=0))
                    {
                        woo[i].l=0;
                        j=i;
                        k++;
                    }
                }
                woo[l].l=0;
                s++;
                n-=k;
            }
            cout<<s<<endl;
        }
    }
    return 0;
}