Can Anyone solve it in O(n) time.

Правка en1, от RJO4, 2022-12-02 00:19:10

Given an array of n elements and an integer K, the task is to find the subarray with minimum value of ||a[i] + a[i + 1] + ……. a[j]| – K|. Array may contain negative values. N<=1e5.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский RJO4 2022-12-02 00:19:10 217 Initial revision (published)