Is there any Algorithm for this ?

Правка en1, от spakk9, 2020-06-26 14:49:07
Suppose we are given two increasing arrays A and B , we need to find max((a[j]-a[i-1] )- (b[j]-b[i-1])) , where j>=i .

Can we solve it in better than O(n^2) time complexity . If so , please give me any Hint .


Теги #c++, #algorithms, #arrays, #help

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский spakk9 2020-06-26 14:49:07 266 Initial revision (published)