plagues's blog

Can we solve this problem faster then O(n^2)?
By plagues, history, 2 years ago, translation, In English

You are given two arrays: a, b

We need to calculate for each x: c[x] = max(a[j] + b[x — j]), for each 0 <= j < x

a, b are sorted

  • Vote: I like it
  • +14
  • Vote: I do not like it