Discussion @ 1273. Tie @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1273. Tie

How did you do it in O(n^2). I only know n^3 =(

Posted by hey, dude! 4 Apr 2005 14:56

Re: How did you do it in O(n^2). I only know n^3 =(

Posted by Cybernetics Team 4 Apr 2005 16:55

It also can be done in O(K * logK). O(N^2) is with DP, a classic problem (longest increasing subset)