Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
| Name |
|---|



MDOLLS on SPOJ uses Dilworth's theorem.
Appreciated :D
The classical O(N lg N) algorithm for longest increasing subsequence (LIS) can be seen as an application of Dilworth's Theorem. See here: http://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/
A problem from the third round of 2015 Facebook Hacker Cup
https://www.facebook.com/hackercup/problem/847639175277938/
Solution: https://www.facebook.com/notes/1056536891028878
Another good problem (Dilworth's on longest increasing subsequence) is Cow Jog from USACO December 2014.