BD_SM's blog

By BD_SM, history, 5 years ago, In English need help on how to solve this problem? I am storing for each i the closest time when a picture finishes if we start at i. This preprocess is O(n) but query worst case is o(n).help pls!

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

| Write comment?