zoj 2882 Nested Dolls

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1881

 

经典的LIS问题.第一次做这种题目时,做了很长时间,最主要的是二分搜索的代码难写,特容易写错,边界太难考虑了.

 

这题和1025差不多,先排序.但是排序的顺序却和那个不一样.因为这题说:w₁ < w₂ and h₁ < h₂ 而那题却是 l<=l' and w<=w'

然后是求一个最长不严格递减子序列就可以了.而1025是求最长严格单调递减子序列.

 

/* * 2882.cpp * * Created on: Apr 2, 2010 * Author: wyy * */ #include<iostream> #include<algorithm> using namespace std; struct Dolls { int w; int h; }; int cmp(const Dolls &a, const Dolls &b) { if(a.w == b.w) return a.h > b.h; else return a.w < b.w; } int main() { freopen("input.txt", "r", stdin); int T; const int SIZE = 20001; Dolls st[SIZE]; int b[SIZE]; cin >> T; while(T--) { int n; cin >> n; for(int i = 0; i != n; ++i) cin >> st[i].w >> st[i].h; sort(st, st + n, cmp); int len = 1; b[1] = st[0].h; int left, right, mid; for(int i = 1; i != n; ++i) { left = 1; right = len; while(left <= right) { mid = (left + right) >> 1; if(st[i].h <= b[mid]) left = mid + 1; else right = mid - 1; } b[left] = st[i].h; if(left > len) ++len; } cout << len << endl; } //fclose(stdin); return 0; }