Nested_Dolls(偏序集)
2009-09-15 20:43
435 查看
Nested Dolls
Description
Dilworth
is the world's most prominent collector of Russian nested dolls: he
literally has thousands of them! You know, the wooden hollow dolls of
different sizes of which the smallest doll is contained in the second
smallest, and this doll is in turn contained in the next one and so
forth. One day he wonders if there is another way of nesting them so he
will end up with fewer nested dolls? After all, that would make his
collection even more magnificent! He unpacks each nested doll and
measures the width and height of each contained doll. A doll with width
w
1
and height h
1
will fit in another doll of width w
2
and height h
= if and only if w
1
< w
2
and h
1
< h
2
. Can you help him calculate the smallest number of nested dolls possible to assemble from his massive list of measurements?
Input
On the first line of input is a single positive integer 1 ≤ t
≤ 20 specifying the number of test cases to follow. Each test case begins with a positive integer 1 ≤ m
≤ 20000 on a line of itself telling the number of dolls in the test case. Next follow 2m
positive integers w
1
, h
1
,w
2
, h
2
, ... ,wm
, hm
, where wi
is the width and hi
is the height of doll number i
. 1 ≤ wi
, hi
≤ 10000 for all i
.
Output
For each test case there should be one line of output containing the minimum number of nested dolls possible.
Sample Input
Sample Output
Source
Nordic 2007
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 3570 | Accepted: 949 |
Dilworth
is the world's most prominent collector of Russian nested dolls: he
literally has thousands of them! You know, the wooden hollow dolls of
different sizes of which the smallest doll is contained in the second
smallest, and this doll is in turn contained in the next one and so
forth. One day he wonders if there is another way of nesting them so he
will end up with fewer nested dolls? After all, that would make his
collection even more magnificent! He unpacks each nested doll and
measures the width and height of each contained doll. A doll with width
w
1
and height h
1
will fit in another doll of width w
2
and height h
= if and only if w
1
< w
2
and h
1
< h
2
. Can you help him calculate the smallest number of nested dolls possible to assemble from his massive list of measurements?
Input
On the first line of input is a single positive integer 1 ≤ t
≤ 20 specifying the number of test cases to follow. Each test case begins with a positive integer 1 ≤ m
≤ 20000 on a line of itself telling the number of dolls in the test case. Next follow 2m
positive integers w
1
, h
1
,w
2
, h
2
, ... ,wm
, hm
, where wi
is the width and hi
is the height of doll number i
. 1 ≤ wi
, hi
≤ 10000 for all i
.
Output
For each test case there should be one line of output containing the minimum number of nested dolls possible.
Sample Input
4 3 20 30 40 50 30 40 4 20 30 10 10 30 20 40 50 3 10 30 20 20 30 10 4 10 10 20 30 40 50 39 51
Sample Output
1 2 3 2
Source
Nordic 2007
相关文章推荐
- 【POJ3636】Nested Dolls Dilworth定理(偏序集定理二)
- SPOJ 3943 - Nested Dolls 最长不下降子序列LIS(二分写法)
- HDU 1667 Nested Dolls
- hdu 1677 Nested Dolls (Greedy + Treap)
- HDU 1677 Nested Dolls(排序+二分)
- HDU OJ 1677 Nested Dolls【二分,LIS】
- HDU1677:Nested Dolls
- hdu 1677 Nested Dolls(贪心+LIS模板题)
- hdu1677--Nested Dolls(贪心+LIS)
- SPOJ 3943 Nested Dolls
- poj3636 Nested Dolls
- hdu1677: Nested Dolls
- HDU1677 Nested Dolls
- uva 11368 - Nested Dolls(sort+greedy+binary_search)
- 606第十周周六赛E - Nested Dolls 套玩具
- POJ3636Nested Dolls
- POJ 3636 俄罗斯Nested Dolls 贪心二分 动态规划
- HDOJ 1677 Nested Dolls(贪心+LIS)
- Nested Dolls (单调递增子序列 + 二分)
- HDU 1677:Nested Dolls