题意：长方块嵌套，不能旋转，严格递增，建立二分图 求最大匹配 #include<cstdio>#include<iostream>#include<algorithm>#include<cmath>#include<set>#include<map>#include<string>#include<cstring>#include<stack>#include<queue>

Nested Dolls http://acm.hdu.edu.cn/showproblem.php?pid=1677 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2286    Accepted Submission(s)

题目链接：http://poj.org/problem?id=3636 最小链划分数 = 最长反链长度 按如下关系排序： w 1 &gt; w 2 ∨ ( w 1 = w 2 ∧ h 1 ≤ h 2 ) w_1 \gt w_2 \lor (w_1 = w_2 \land h_1 \le h_2) w1​>w2​∨(w1​=w2​∧h1​≤h2​) 定义反链： w 1 ≥ w 2 ∧ h 1 ≤