find minimum

Revision en2, by acc20020, 2018-10-12 17:41:44

given two arrays A0, ..., AN and B0, ..., BN, with 0 ≤ Ai, Bi ≤ N. find for each 0 ≤ x ≤ 2·N. How can I solve this problem faster than O(N2)?

Tags minimum

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English acc20020 2018-10-12 17:41:44 15 Tiny change: ' $\min_{i=0\dots x} (' -> ' $\min_{i=min(0,N-x)\dots x} ('
en1 English acc20020 2018-10-12 17:38:49 218 Initial revision (published)