gvaibhav21's blog

By gvaibhav21, history, 9 years ago, In English

Spoj Problem: LIS2

I tried this using 2-D BIT, with a time complexity: O(n*logn*logn) but i am getting TLE.

My submitted code: http://ideone.com/kaYVz1

Any ideas?

  • Vote: I like it
  • 0
  • Vote: I do not like it

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