Yep, i don't know, but i think this exercise can be done in O(n(Logn)²), cause first you need to check what lingerie you are going to look, i tried a simple map (name->lingerie)[here the Logn comes], but got wrong answer....any ideas?
2009/10/2 Mustafa Emre Acer <[email protected]> > What is time complexity of this XNXX? Can it be achieved in nlogn? I > couldn't get lingerie part to work. Can someone post their code? > > > On Thu, Oct 1, 2009 at 7:51 PM, Bartholomew Furrow <[email protected]>wrote: > >> Yeah, sorry about this crap -- one of us moderators fat-fingered the >> "accept" button by mistake. A fair amount gets sent to the list, so >> occasionally we click the wrong button and it gets through. >> On Thu, Oct 1, 2009 at 6:34 PM, gustavo pacianotto gouveia < >> [email protected]> wrote: >> >>> lol! SPAM, SPAM, SPAM with cheese & SPAM! >>> >> >> Sshh, dear, don't cause a fuss. I'll have your spam. I love it. I'm having >> spam spam spam spam spam spam spam baked beans spam spam spam and spam! >> >> 2009/9/29 borad <[email protected]> >>> >>>> <sex stuff> >>> >>> >> >> > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
