Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
| 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.