Discussion @ 1069. Prufer Code @ Timus Online Judge

How to solve this fast?

Posted by Evil Cheater 14 Jul 2003 10:28

Hi!

I already solved this problem (on paper), but in O(n^2). How can I
solve it in O(n) or O(n logn)? Also, what are heaps?

Thanks in advance!

Re: How to solve this fast?

Posted by GodZilla 14 Jul 2003 12:03

> Hi!

>

> I already solved this problem (on paper), but in O(n^2). How can I

> solve it in O(n) or O(n logn)? Also, what are heaps?

>

> Thanks in advance!

Use Hesh Function !!!

Re: How to solve this fast?

Posted by Evil Cheater 15 Jul 2003 09:23

Thanks, but what's hesh function?

Discussion of Problem 1069. Prufer Code