# Wooden Sticks

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

没什么特别想法

#include <iostream>
using namespace std;

void bsort (int a[], int n, int b[]);

int main()
{
int n;
cin >> n;
while(n--) {
int n1;
cin >> n1;
int count = 0;
int a[5001] = {0}, b[5001] = {0};
int i = 0;
int flag[5001];
while(n1--) {
cin >> a[i] >> b[i];
flag[i] = 1;
i++;
}
bsort(a, i, b);
for(int k = i - 1; k >= 0; k--) {
int w = k;
if(flag[w]){
if(w == 0) count++;
else
for(int q = w - 1; q >= 0; q--) {
if(b[w] >= b[q] && flag[q] == 1) {
flag[w] = 0;
flag[q] = 0;
w = q;
}
if(q == 0) count++;
}
}
}
cout << count << endl;
}
}

void bsort (int a[], int n, int b[])
{
int i, k;
for(i = 0; i < n - 1; i++)
for(k = 0; k < n - 1 - i; k++) {
if(a[k] > a[k+1]) {
int t = a[k];
a[k] = a[k+1];
a[k+1] = t;
int q = b[k];
b[k] = b[k+1];
b[k+1] = q;
}
}
}

2 1 3

#### [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

#### HDU 1051：Wooden Sticks

2014-07-31 21:04:41

#### Wooden Sticks (HDU 1051)

2015-01-05 20:25:32