March Easy problem:

Правка en1, от kabirsahni8, 2017-03-02 00:56:48

Given an array how to find sum of all f(A',k) where A' is subarray of A and f(A',k) are total unordered pairs (i,j) such that abs(A[i]−A[j])>=k.How to solve this using segment tree.What should be the merge function?

Теги segment tree, hackerearth

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский kabirsahni8 2017-03-02 01:04:55 229
en1 Английский kabirsahni8 2017-03-02 00:56:48 236 Initial revision (published)