Обсуждение @ 1173. Lazy Snail @ Timus Online Judge

It doesn'e need convexhull. Sorting is enough!

Послано shrek 19 ноя 2006 20:22

Re: It doesn'e need convexhull. Sorting is enough!

Послано Denis Koshman 17 авг 2008 19:12

Yeah... Came back to this problem when realized that myself :)

Re: It doesn'e need convexhull. Sorting is enough!

Послано SkorKNURE 8 окт 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!

Послано hoan 27 ноя 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!!!

Обсуждение задачи 1173. Lazy Snail