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
1510
. Order
Shady TKTL
Quick Algo ! ? ! ? ! ?
[2] // Problem
1510. Order
12 Mar 2007 22:12
I think like that
Firstly, I must use count sort or heap sort?
Then count maximal number and write it.
Am I right?
KIRILL(ArcSTU)
Re: Quick Algo ! ? ! ? ! ?
[1] // Problem
1510. Order
12 Mar 2007 22:22
The simplest way is Qsort and out mas[n div 2] O(n*lgn)
Read other thread for fast O(n)
Shady TKTL
Re: Quick Algo ! ? ! ? ! ?
// Problem
1510. Order
12 Mar 2007 22:24
Thanks to you KIRILL(ArcSTU)
© 2000–2024
Timus Online Judge Team
. All rights reserved.