ENG  RUSTimus 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
back to board

Discussion of Problem 1273. Tie

DP can AC in O(n^2)......but waht algo can AC in O(nlogn)?
Posted by Yu YuanMing 9 Oct 2004 20:59
Re: DP can AC in O(n^2)......but waht algo can AC in O(nlogn)?
Posted by XieZheng 11 May 2011 21:39
also DP....
It's obvious that LIS can be sloved in O(nlogn)...