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 1004. Sightseeing Trip

Still could be solved by O(n^4) algorithm
Posted by Alexander Kouprin 23 Nov 2014 13:41
0.343 sec.
Just to let you know. ;)
Re: Still could be solved by O(n^4) algorithm
Heh, 0.35 sec... Mine is O(N^4) and 0.078