dush1729's blog

Better complexity of Codechef Paying Up
By dush1729, history, 9 years ago, In English

Problem link

I have done this problem with time complexity O( nlogn + n * m ) and space complexity O( 2 * m ). How can i improve this?

  • Vote: I like it
  • -16
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

No answers. ._.

→ Reply