Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
Could anyone suggest some problems which utilize Dilworth's theorem? Thanks in advance :)
Название |
---|
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.