POJ 1065 Wooden Sticks 贪心+动态规划之单调递增子序列

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

题目大意：
现有一批长度与质量都已知的木材，需要一个机器处理这些木材，机器开启的时候需要耗费一个单位的时间，如果第i+1个木材的重量和长度都大于等于第i个处理的木材，那么将不会额外耗费时间，否则需要额外消耗一个单位的时间。求出处理完这批木材所用的最少时间。

解题思路：
贪心+动态规划之单调递增子序列
首先将木材排序，方法为按照长度从小到大排序，若长度相同则按照重量从小到大排序。

struct node {
	int len, weight;
	bool operator < (const node &a) const {
		if (a.len == len) { return weight < a.weight; }
		return len < a.len;
	}
}list[5001];

然后检查第一根木材，选出后续满足条件len'>=len && weight'>=weight的木材，然后依次递推，选出第一群木材。选出的木材便不再参与后续的其它木材群的选择。然后进行相同的过程标记第二群木棍。遍历完所有的木材之后，木材的群数即为所求的时间。

AC代码

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int dp[5001];
struct node {
	int len, weight;
	bool operator < (const node &a) const {
		if (a.len == len) { return weight < a.weight; }
		return len < a.len;
	}
}list[5001];
bool used[5001];
int main() {
	int t, n;
	scanf_s("%d", &t);
	while (t--) {
		int ans = 0;
		int n; scanf_s("%d", &n);
		for (int i = 1; i <= n; i++) {
			scanf_s("%d%d", &list[i].len, &list[i].weight);
			used[i] = false;
		}
		sort(list + 1, list + 1 + n);
		int now;
		for (int i = 1; i <= n; i++) {
			if (!used[i]) {
				now = i;
				for (int j = i + 1; j <= n; j++) {
					if (!used[j] && list[j].weight >= list[now].weight) {
						used[j] = true; now = j;
					}
				}
				ans++;
			}
		}
		cout << ans << endl;
	}
}