# HDU 1051 Wooden Sticks

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<algorithm>
using namespace std;
struct wood
{
int l,w;

}w[5005],wo[5005];
bool cmp(wood x,wood y)
{
if(x.l==y.l)
return x.w<y.w;
else
return x.l<y.l;
}
int main()
{
int t,n,x,y,i,j,k,f,a;
cin>>t;
while(t--)
{
cin>>n;
for(i=0;i<n;i++)
cin>>wo[i].l>>wo[i].w;
sort(wo,wo+n,cmp);

k=0;
for(a=0;a<n;a++)
{
f=0;
for(i=0;i<k;i++)
{
if(wo[a].l>=w[i].l &&wo[a].w>=w[i].w)
{
f=1;
w[i].l=wo[a].l;
w[i].w=wo[a].w;
break;
}

}
if(!f)
{
j=k;
w[j].l=wo[a].l;
w[j].w=wo[a].w;
k++;
}

}
cout<<k<<endl;

}

}








#### [ACM] hdu 1051 Wooden Sticks

2014-03-10 20:56:49

#### HDU-1051-Wooden Sticks(C++ && 不水的贪心！)

2015-06-20 11:38:29

#### HDU1051 Wooden Sticks【贪心】

2015-04-18 14:02:23

#### 杭电1051Wooden Sticks

2016-08-12 12:15:40

#### 杭电OJ——1051 Wooden Sticks

2012-10-26 22:52:00

#### ACM--木头序列--贪心+递减子序列--HDOJ 1051--Wooden Sticks

2016-05-29 12:01:41

#### POJ1065Wooden Sticks(最小上升序列)

2016-08-12 18:26:32

#### POJ1065 Wooden Sticks（贪心+动态规划——单调递增子序列）

2011-05-14 16:27:00

#### Wooden Sticks (HDU 1051)

2015-01-05 20:25:32

#### HDU 1051：Wooden Sticks

2014-07-31 21:04:41