Search found 1 match

by ltdtl
Sun Feb 18, 2007 12:47 am
Forum: ACM ICPC Archive Board
Topic: Problem 3277 : Workshops
Replies: 7
Views: 6768

workshops

You can solve it using greedy alg.
it will take O(nlogn+rlogr+ nr).
if you make a good implementation, it will be reduced into O(xlogx), but it is not necessary (i guess).

Go to advanced search