Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

sillyboi's blog

By sillyboi, history, 2 months ago, In English,

I recently saw the nlogn approach for longest increasing subsequence problem(LIS) and read that it is somehow related to dilworth's theorem. Can someone pls explain how can we implement lis making use of dilworth's theorem. Thanks!

  • Vote: I like it
  • -5
  • Vote: I do not like it