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 1056. Centers of the Net

an O(n) || O(n log n) algo.
Posted by GoGo 9 Jul 2001 20:05
do you know a linear algo for this problem
Re: an O(n) || O(n log n) algo.
Posted by Jon McAlister 5 Aug 2001 03:40
Yes, there certainly is one that is O(M).

-Jon

> do you know a linear algo for this problem