POJ 1065 Wooden Sticks （dp）

Wooden Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 18903		Accepted: 7954

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

定义偏序关系“<=”为 l<=l' && w<=w'  排序以后 求最小链划分 根据Dilworth定理 即为求最大反链大小 - - 

即为求 w的最大下降子序列 O(nlogn)求解即可

AC代码如下：

//
//  POJ 1065 Wooden Sticks
//
//  Created by TaoSama on 2015-03-05
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

int dp[5005];
struct Stick {
	int l, w;
	bool operator<(const Stick& rhs)const {
		return l < rhs.l || l == rhs.l && w < rhs.w;
	}
} a[5005];

int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	int t; cin >> t;
	while(t--) {
		int n; cin >> n;
		for(int i = 1; i <= n; ++i)
			cin >> a[i].l >> a[i].w;
		sort(a + 1, a + 1 + n);
		int ans = 1;
		memset(dp, 0, sizeof dp);
		for(int i = 1; i <= n; ++i) {
			int l = 1, r = ans;
			while(l <= r) {
				int mid = (l + r) >> 1;
				if(dp[mid] > a[i].w) l = mid + 1;
				else 	r = mid - 1;
			}
			dp[l] = a[i].w;
			ans = max(ans, l);
		}
		cout << ans << endl;
	}
	return 0;
}