ENG
RUS
Timus 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
1069
. Prufer Code
No subject
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!
© 2000–2024
Timus Online Judge Team
. All rights reserved.