ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1173. Lazy Snail

It doesn'e need convexhull. Sorting is enough!
Posted by shrek 19 Nov 2006 20:22
Re: It doesn'e need convexhull. Sorting is enough!
Posted by Denis Koshman 17 Aug 2008 19:12
Yeah... Came back to this problem when realized that myself :)
Re: It doesn'e need convexhull. Sorting is enough!
Posted by SkorKNURE 8 Oct 2008 06:21
I had solved problem by building O(N) convex hulls and then unifying them up from the deepest. How to solve it with only sort? Give me some hints please
Re: It doesn'e need convexhull. Sorting is enough!
Posted by hoan 27 Nov 2010 23:56
how to use convexhull in O(n), when the input have arbitary order, "skorKNURE" or any person plz help and explain this algo to me?

sorry for my poor englis.
GOOD LUCK!!!